Skip to content
MathClicksIGCSE← All notes Cambridge IGCSE® Mathematics 0580 Extended Chapter 24 — Probability Using Tree Diagrams and Venn Diagrams

24.1  Tree Diagrams

Tree diagrams for two-stage events — multiply along the branches, add between them, and handle without-replacement problems where the second-stage fractions change.

Building a tree diagram

A tree diagram is a picture of an experiment that happens in stages — draw a counter, then draw another; toss a coin, then toss it again. Each stage adds a new layer of branches. On the exam the convention is fixed: outcomes are written at the end of each branch and probabilities are written beside each branch. Paper 4 often prints a half-finished tree and asks you to complete it, so you need to know exactly where every number goes.

Key idea From any single point, draw one branch for every possible outcome of that stage. Because those outcomes cover everything that can happen, the probabilities on the branches leaving any one point always add to 1. That is true at the start of the tree and at every branch point after it.

Here is the full tree for a bag containing 3 red and 2 blue counters, where a counter is taken, put back, and a second counter is taken. Putting it back means the second draw looks exactly like the first, so the same fractions appear twice.

Two draws with replacement — 3 red, 2 blue

First draw Second draw Outcome 3/5 2/5 R B 3/5 2/5 3/5 2/5 RR RB BR BB 3/5 × 3/5 = 9/25 3/5 × 2/5 = 6/25 2/5 × 3/5 = 6/25 2/5 × 2/5 = 4/25 Check: every branch pair adds to 1, and 9/25 + 6/25 + 6/25 + 4/25 = 25/25 = 1
Watch out Before you calculate anything, check that each pair of branches adds to 1. This is the same self-check the examiner uses when marking a “complete the tree” part. If your pair adds to anything else, one fraction is wrong — fix it before it poisons every later answer.

Tree or possibility grid?

A possibility (sample space) grid is great when the two stages are equally likely lists — two fair dice give a tidy 6 × 6 grid of 36 equal squares. A tree wins when the outcomes are not equally likely (a biased spinner, 3 red vs 2 blue) or when the second stage depends on the first (without replacement). In Chapter 24 almost every question is one of those two cases, so the tree is your default.

The two rules: multiply along, add between

Every tree-diagram calculation in IGCSE uses just two rules, and the word in the question tells you which one you need.

Rule 1 — MULTIPLY along a path

“Red and then red” means travelling along one path from left to right. Multiply the probabilities you pass: P(RR) = 35 × 35 = 925.

Rule 2 — ADD between paths

“One of each colour” can happen more than one way: RB or BR. Work out each complete path, then add them: 625 + 625 = 1225.

P(A then B) = P(A) × P(B after A) Along a path: AND means multiply
Why multiplying works Think of repeating the experiment 25 times. You expect red first in 3/5 of them — that is 15 experiments. Of those 15, you expect red again in 3/5 — that is 9. So RR happens in about 9 out of 25 repeats: 3/5 × 3/5 = 9/25. Multiplying takes “a fraction of a fraction”.
Example 1A bag contains 3 red and 2 blue counters. A counter is taken at random, replaced, and a second counter is taken. Find the probability that both counters are the same colour.
1
“Same colour” means RR or BB — two paths, so multiply along each, then add. Paths that qualify: R,R  and  B,B
2
Multiply along the RR path. With replacement, the second fractions match the first. P(RR) = 3/5 × 3/5 = 9/25
3
Multiply along the BB path. P(BB) = 2/5 × 2/5 = 4/25
4
Add the two qualifying paths. P(same colour) = 9/25 + 4/25 = 13/25
P(same colour) = 1325
Exam tip Keep every path over the same denominator (here 25) and only simplify at the very end. The mark scheme gives method marks for correct unsimplified paths like 9/25 + 4/25 even if you slip later.

Without replacement — the fractions change

Now the heart of the topic. If the first counter is not put back, the bag is different when you make the second draw: one counter fewer in total, and one fewer of whichever colour left the bag. So on the second stage of the tree, both the numerator and the denominator shrink — and the second-stage branches after R are different from the branches after B.

Key idea Without replacement, the second-stage probability depends on what happened first. The branch labelled “R then R” carries the probability of a red given that a red has already gone. These are called conditional probabilities — you will meet them properly in 24.3, but you are already using them every time you draw this tree.

Take a bag of 5 red and 3 blue counters, two draws, no replacement. First draw: P(R) = 5/8. If that red goes, 4 red remain out of 7 counters, so the next branch is 4/7. If a blue went instead, all 5 reds remain out of 7: 5/7.

Two draws without replacement — 5 red, 3 blue

First draw (out of 8) Second draw (out of 7) 5/8 3/8 R B 4/7 3/7 5/7 2/7 RR RB BR BB 5/8 × 4/7 = 20/56 5/8 × 3/7 = 15/56 3/8 × 5/7 = 15/56 3/8 × 2/7 = 6/56 Check: 20/56 + 15/56 + 15/56 + 6/56 = 56/56 = 1
Watch out The classic error is changing only the numerator: writing 4/8 instead of 4/7. A counter has left the bag, so the denominator drops too. On the second stage every branch should be over n − 1. If you see a second-stage branch with the original denominator, it is wrong.
Example 2A bag contains 5 red and 3 blue counters. Two counters are taken at random without replacement. Find the probability that the counters are different colours.
1
“Different colours” qualifies two paths: RB and BR. Multiply along each. P(RB) = 5/8 × 3/7 = 15/56
2
On the BR path a blue leaves first, so 5 reds remain out of 7. P(BR) = 3/8 × 5/7 = 15/56
3
Add the qualifying paths and simplify. P(different) = 15/56 + 15/56 = 30/56 = 15/28
P(different colours) = 1528
Why the two paths matched RB and BR always have equal probability (5 × 3 on top either way, 8 × 7 underneath), but never assume it — write both paths out. The mark scheme wants to see both products.

Tree diagram calculator

Set the red and blue counts, switch between with and without replacement, and watch every branch fraction and path probability redraw itself.

“At least one” — the complement shortcut

“Find the probability of at least one red” sounds like a long job: RR, RB and BR all qualify, so that is three multiplications and an addition. There is a much faster route. The only outcome with no red at all is BB, so:

P(at least one) = 1 − P(none) The single most valuable shortcut in this chapter

One path instead of three — and the saving grows with the tree. Whenever a question says “at least one”, your first thought should be “what is P(none)?”.

Example 3Each seed of a certain plant germinates with probability 0.85, independently. Amira plants two seeds. Find the probability that at least one seed germinates.
1
The complement of “at least one germinates” is “none germinate”. P(a seed fails) = 1 − 0.85 = 0.15
2
Multiply along the fail–fail path (independent, so the 0.15 repeats). P(none germinate) = 0.15 × 0.15 = 0.0225
3
Subtract from 1. P(at least one) = 1 − 0.0225 = 0.9775
P(at least one germinates) = 0.9775
Exam tip Check the direct route agrees: 0.85×0.85 + 0.85×0.15 + 0.15×0.85 = 0.7225 + 0.1275 + 0.1275 = 0.9775. Same answer, three times the work — that is why Paper 4 loves setting this with three stages, where the direct route becomes seven paths.

Three stages? Same rules

A three-stage tree (three draws, three mornings, three penalty kicks) just adds one more layer: eight paths for two outcomes per stage. Nothing new — still multiply along, add between. For a fair coin tossed three times, P(HHH) = 12 × 12 × 12 = 18. And the shortcut gets even better: P(at least one head) = 1 − P(TTT) = 1 − 1/8 = 7/8 — one path instead of seven.

More worked examples

Example 4A box holds 4 green and 6 yellow sweets. Two sweets are taken without replacement. (a) Given that the first sweet is green, write down the probability that the second is green. (b) Find the probability that both sweets are green.
1
(a) “Given that the first is green” means you are already standing at the G node — just read the next branch. One green has gone: 3 green left out of 9 sweets. P(second green | first green) = 3/9 = 1/3
2
(b) “Both green” is the whole G–G path from the start, so multiply along it. P(GG) = 4/10 × 3/9 = 12/90 = 2/15
(a) 13     (b) 215
Spot the difference Part (a) is a single branch (the condition has already happened); part (b) is a whole path (multiply from the start). Deciding which one the wording asks for is exactly what 24.3 is about.
Example 5A bag contains 2 red, 3 blue and 5 green discs. Two discs are taken at random without replacement. Find the probability that both discs are the same colour.
1
Three colours means three branches at each stage — nine paths in all, but only RR, BB and GG qualify. There are 10 discs, then 9. P(RR) = 2/10 × 1/9 = 2/90
2
Same idea for blue: one blue gone leaves 2 of 9. P(BB) = 3/10 × 2/9 = 6/90
3
And for green. P(GG) = 5/10 × 4/9 = 20/90
4
Add the qualifying paths and simplify. P(same colour) = 2/90 + 6/90 + 20/90 = 28/90 = 14/45
P(same colour) = 1445
Exam trap Two traps live in this question. First, writing 2/10 × 1/10 — without replacement the denominator must drop to 9. Second, forgetting one of the three same-colour paths (usually RR, because red is smallest). Draw all three branches at the first stage before you calculate anything.

Your turn

Practice set

  1. A fair coin is tossed twice. Use a tree diagram to find the probability of exactly one head.
  2. A spinner lands on WIN with probability 0.2. It is spun twice. Find the probability of (a) two wins, (b) no wins.
  3. A bag holds 4 red and 6 blue counters. Two are taken without replacement. Find P(both red).
  4. Using the same bag as question 3, find the probability that the two counters are different colours.
  5. A machine breaks down on any given day with probability 0.05, independently of other days. Find the probability that it breaks down at least once in three days. Give your answer to 3 significant figures.

  1. Qualifying paths HT and TH: 1/2 × 1/2 + 1/2 × 1/2 = 1/4 + 1/4 = 1/2
  2. (a) 0.2 × 0.2 = 0.04   (b) 0.8 × 0.8 = 0.64
  3. 4/10 × 3/9 = 12/90 = 2/15 (both fractions shrink — a red has gone).
  4. RB or BR: 4/10 × 6/9 + 6/10 × 4/9 = 24/90 + 24/90 = 48/90 = 8/15
  5. P(no breakdowns) = 0.95³ = 0.857375, so 1 − 0.857375 = 0.142625 = 0.143 (3 s.f.)

Key points to remember

  • On a tree diagram, outcomes go at the end of branches, probabilities beside them — and the branches leaving any point add to 1. Check every pair before calculating.
  • Multiply along a path for “and then”; add between the paths that qualify for “or”.
  • With replacement: the second-stage fractions repeat the first. Without replacement: numerator and denominator both shrink by what has already been removed.
  • The second-stage branches of a without-replacement tree are conditional probabilities — they depend on the first draw.
  • P(at least one) = 1 − P(none) — one path instead of many. Reach for it the moment you read “at least”.
  • Keep all paths over a common denominator and simplify only at the end — method marks live in the unsimplified products.
  • Use a possibility grid for two equally likely lists (two dice); use a tree for unequal probabilities or without replacement.

Where next?

✅ Mark scheme All notes

Progress is saved on this device only and appears on the notes home page.