A box contains 6 red, 5 green and 4 yellow prize tokens. Three tokens are drawn one after another without replacement.
For Higher questions, extend the tree to three stages. Multiply along the Yellow → Red → Green path and reduce totals each time.
This question is GCSE Higher because it involves three dependent stages. Unlike simpler two-step questions, you must update the total number of items twice, and you must keep track of which colours have changed after each draw. A tree diagram helps organise this clearly, but it must be built carefully.
The draws are without replacement. That means after each draw:
These are dependent events because the second and third probabilities depend on what happened earlier.
For Higher tier, it is often necessary to show more branches than at Foundation. A suitable approach is:
This creates a clear three-level tree focused on the required path, without drawing every possible outcome.
Once the tree is labelled, the probability of a specific sequence is found by multiplying the probabilities along that path. For example, the path “Yellow then Red then Green” is:
P(Y then R then G) = P(Y) × P(R|Y) × P(G|Y and R)
A jar contains 3 red, 2 green and 1 yellow counter. Three counters are drawn without replacement. Find the probability of drawing Yellow then Red then Green.
If a question involves three dependent selections, a tree diagram is one of the safest methods. Label the totals at each stage before you write any fractions. This prevents the most common errors.
Study tip: For three-stage trees, write the totals under each level (15 → 14 → 13) to keep your denominators correct.
Enjoyed this question?