Hi, I’m Ari. We can start tree diagrams from the beginning, work through an example together, or practise a question. Tell me which step is confusing.
GCSE Maths · Probability
Tree diagrams GCSE Questions and Worked Answers
A probability tree shows outcomes in order. Multiply the branch probabilities along one complete path, then add the probabilities of distinct paths that satisfy the question. Update later branches when earlier results change the possibilities.
Free AI tutor · GCSE tree diagrams
Practise GCSE tree diagrams for free with an AI tutor
Ask Ari for an explanation or work through an original exam-style question together.
Ari is an AI tutor and can make mistakes. Use the worked answers below to check important results.
Start with the meaning
What you need to know about tree diagrams
Toss a fair coin twice and record the results in order. The possibilities are HH, HT, TH and TT, where H means heads and T means tails. HT and TH are different records because the order differs. Each first toss can be followed by either result on the second toss. A tree draws these choices as branches, so every complete route records one possible sequence.
See the idea first
Follow one sequence from left to right
A probability describes how likely an outcome is, from 0 (impossible) to 1 (certain). A fair coin has probability 1/2 for each result. After either first result, the next independent toss still has two equally likely outcomes. Each complete route has probability 1/2 × 1/2 = 1/4.
From problem to method
Typical problems you need to be able to solve
These are the main kinds of question in this topic. Each card first states the problem, then explains how to solve it.
Find one ordered sequence
What the problem asks: For two fair coin tosses, find the probability of heads then tails.
How to solve it: Follow the H branch and then its T branch. Half of a half is a quarter, so multiply 1/2 by 1/2.
Find an outcome with more than one route
What the problem asks: Find the probability of exactly one head in two fair tosses.
How to solve it: The separate routes are HT and TH. They cannot both describe the same pair of tosses, so add their probabilities: 1/4 + 1/4 = 1/2.
Draw without replacement
What the problem asks: A bag contains 3 red and 2 blue counters. Draw two without putting the first back. What changes?
How to solve it: After red, 2 red and 2 blue remain: use 2/4 and 2/4. After blue, 3 red and 1 blue remain: use 3/4 and 1/4. Each second branch describes the bag after its own first result.
Find at least one success
What the problem asks: Find the chance of at least one head in three fair tosses.
How to solve it: The only excluded sequence is TTT, with probability 1/8. Subtract from 1 to get 7/8. This complement method saves listing seven successful routes.
A reliable routine
For a sequence with branch probabilities
A later branch gives the chance of its outcome after the earlier results on that route. Multiplying gives the fraction that survives every stage. Adding works for distinct complete routes because those sequences are mutually exclusive: one trial cannot end on two routes.
- Draw a stage for each event, label the outcomes and attach probabilities to branches.
- Check that branches leaving each individual node sum to 1. Update remaining counts when needed.
- Identify complete paths matching the wording, including order and ‘exactly’ versus ‘at least’.
- Multiply along each selected path, then add distinct matching paths, or subtract the excluded outcome from 1.
Check: Equal numbers of branches do not guarantee equal probabilities. Replacement restores the bag's counts; without replacement, later probabilities depend on the first draw. Independence means the earlier outcome does not change a later event's probability.
Fully worked
Tree diagrams GCSE worked examples
Each solution explains the clue, why the method fits and how to check the result.
Example 1
One independent path
Question
A fair coin is tossed and a fair six-sided die is rolled independently. Find P(heads then a 6).
The branches have probabilities 1/2 and 1/6.
Both conditions must occur in the same trial.
Example 2
Exactly one success
Question
A player scores each shot with probability 0.7, independently. Find the probability of exactly one score in two shots.
A miss has probability 0.3. The routes are score–miss and miss–score.
Do not count the two-score route.
Example 3
With replacement
Question
A bag contains 4 red and 6 blue counters. Draw a counter, replace it and mix the bag, then draw again. Find P(two red).
Replacing the first counter restores 4 red out of 10 for the second draw.
The second probability stays the same under this random-draw model.
Example 4
Without replacement
Question
The same bag contains 4 red and 6 blue counters. Draw twice without replacement. Find P(two red).
After a red is removed, 3 red remain among 9 counters.
Both the red count and total decrease on this route.
Example 5
Either order without replacement
Question
A bag contains 3 red and 2 blue counters. Draw two without replacement. Find the probability of one of each colour.
There are two possible orders.
Add the distinct routes.
The second branches refer to different remaining bags.
| First draw | Red left | Blue left | Total left |
|---|---|---|---|
| Red | 2 | 2 | 4 |
| Blue | 3 | 1 | 4 |
Example 6
At least one
Question
An alarm fails a test with probability 0.1. Three tests are independent. Find the probability of at least one failure.
The opposite event is no failures: all three tests pass. A pass has probability 0.9.
This includes one, two or three failures.
10 original questions · total 28 marks
Tree diagrams GCSE exam-style questions
Try each question before opening its fully worked answer. The difficulty rises through the set.
Before you startAllow about 33 minutes · Show your working. Give exact answers unless a question asks you to round, and include units where needed. · answers start collapsed
Complete a node
The only branches leaving a node are success with probability 0.65 and failure. Find the failure probability.
Show worked answer
The outcomes at this node are exhaustive and mutually exclusive, so their probabilities sum to 1.
Two heads
A fair coin is tossed twice independently. Find P(HH).
Show worked answer
Follow both H branches.
Different coin results
Two fair independent coin tosses are made. Find the probability that their results differ.
Show worked answer
The routes are HT and TH.
Biased coin
A coin has probability 0.6 of heads on each independent toss. Find P(TT).
Show worked answer
Each tail has probability 1 − 0.6 = 0.4.
Exactly one head
For the same coin with P(H) = 0.6, find P(exactly one head in two independent tosses).
Show worked answer
Replacement
A bag contains 2 green and 3 yellow counters. Draw twice with replacement and mixing. Find P(two green).
Show worked answer
The original counts are restored before the second draw.
No replacement
A bag contains 2 green and 3 yellow counters. Draw twice without replacement. Find P(two green).
Show worked answer
After green, 1 green remains out of 4.
Both orders
A bag contains 2 green and 3 yellow counters. Draw twice without replacement. Find P(one of each colour).
Show worked answer
Include both orders.
Complement
A player succeeds with probability 0.8 on each independent attempt. Find P(at least one success in three attempts).
Show worked answer
The only excluded route is three failures, each with probability 0.2.
A condition narrows the outcomes
A fair coin is tossed twice. Given that at least one result is heads, find the probability that both are heads.
Show worked answer
The condition excludes TT. The remaining equally likely routes are HH, HT and TH. Only one of these three is HH. The vertical bar in the probability notation below means ‘given that’: only outcomes meeting the stated condition are counted.
The denominator refers to the restricted set, not all four original routes.
Examiner-style feedback
Common tree diagrams mistakes
One full path needs every stage to happen, so multiply its conditional branch probabilities.
‘One of each’ may be RB or BR. ‘Red then blue’ asks only for RB.
Without replacement, one counter has gone. Update both the total and the appropriate colour count.
30-second recap
Choose, carry out, check
Translate the wording before you reach for a rule.
- A route records outcomes in order.
- Branches from each node total 1.
- Multiply along routes; add distinct matching routes.
- Use updated counts and read ‘at least’ carefully.
Quick answers
Tree diagrams FAQ
Does without replacement mean Higher only?
No. Dependent combined events and probability trees can appear across tiers. The explicit conditional-probability extension here is labelled Higher.
Why can I add two routes without subtracting an overlap?
Different complete sequences cannot occur in the same trial, so the routes are mutually exclusive. For overlapping events in general, simply adding would double-count the overlap.
Content standards
Curriculum and rights review
P6–P8: probability trees, independent and dependent events across tiers; the explicit conditional-probability question uses Higher P9. Questions, suggested marks, solutions and diagrams are original practice material, not official past-paper questions.
Official specification references