Tree Diagrams GCSE Maths: Higher Revision Guide
Revise tree diagrams for Higher GCSE Maths with clear methods, worked examples, common mistakes and exam-style questions with complete answers.

Tree diagrams represent sequences of events and help you calculate combined probabilities. For Higher GCSE Maths, you must be able to complete tree diagrams, multiply probabilities along branches, add probabilities from different routes, and deal with probabilities that change when objects are selected without replacement.
This guide explains tree diagrams step by step, including independent and dependent events. It also contains worked examples and tree diagrams exam questions pitched at Higher tier.
What is a probability tree diagram?
A probability tree diagram shows every possible outcome when two or more events happen in sequence. Each branch represents an outcome, and the probability of that outcome is written on the branch.
For example, if a biased coin is tossed twice, the first set of branches represents the first toss. A second set grows from each of those branches to represent the second toss.
Tree diagrams are particularly useful because they separate a multi-stage probability problem into manageable steps. They also show whether there is one route or more than one route to the event required by the question.
The probability rules used in tree diagrams
Three rules underpin almost every GCSE tree diagram question.
Probabilities from the same point add to one
The probabilities on all branches leaving the same point must have a total of 111.
For two complementary outcomes AAA and not AAA:
P(A)+P(not A)=1 P(A)+P(\text{not }A)=1 P(A)+P(not A)=1Therefore:
P(not A)=1−P(A) P(\text{not }A)=1-P(A) P(not A)=1−P(A)If the probability that a bus is late is 0.180.180.18, the probability that it is not late is:
1−0.18=0.82 1-0.18=0.82 1−0.18=0.82This rule is used to fill in missing branch probabilities.
Multiply probabilities along a route
The word and usually means that you must follow one complete route through the tree. Multiply the probabilities on that route.
For example:
P(A and B)=P(A)×P(B∣A) P(A\text{ and }B)=P(A)\times P(B\mid A) P(A and B)=P(A)×P(B∣A)The notation P(B∣A)P(B\mid A)P(B∣A) means the probability of BBB given that AAA has already happened.
Add probabilities from separate routes
An event may be possible through more than one route. Work out the probability of each valid route, then add the results.
For example, exactly one success in two attempts can happen as:
- success, then failure
- failure, then success
Therefore:
P(exactly one success)=P(SF)+P(FS) P(\text{exactly one success})=P(SF)+P(FS) P(exactly one success)=P(SF)+P(FS)A reliable summary is multiply along branches and add between routes.
Independent and dependent events
The most important distinction in tree diagrams GCSE Maths questions is whether the probabilities stay the same or change after the first event.
| Type of events | What happens to the probabilities? | Typical context |
|---|---|---|
| Independent events | The second-stage probabilities stay the same | Repeated coin tosses, repeated spins or replacing an object |
| Dependent events | The second-stage probabilities depend on the first outcome | Selecting objects without replacement |
Independent events
Two events are independent when one event does not affect the probability of the other. A coin toss does not normally affect the next coin toss, so the probabilities are repeated on the second set of branches.
Replacing a selected object also makes repeated selections independent. Once the object is returned, the original numbers and probabilities are restored.
Dependent events
Events are dependent when the first outcome changes the probability of the second. This commonly occurs when counters, cards or other objects are selected without replacement.
After one object is removed:
- the total number of objects decreases by 111
- the number of objects of the selected type decreases by 111
- the number of objects of the other type stays unchanged
The second-stage fractions must therefore be recalculated separately after each possible first outcome.
A step-by-step method for tree diagrams
Use this method when answering a complete tree diagram question.
- Identify the stages. Decide what happens first, second and, if necessary, third.
- Label every branch. Use clear outcome labels such as red, blue, win or lose.
- Write the branch probabilities. Check that the probabilities leaving each point add to 111.
- Decide whether the events are independent or dependent. Look for phrases such as “replaced” and “without replacement”.
- Mark the routes that satisfy the question. This prevents you from including an invalid route or missing a valid one.
- Multiply along each valid route. This gives the probability of that complete sequence.
- Add the route probabilities when necessary. Do this if the required event can happen in several ways.
- Check the final answer. A probability must be between 000 and 111 inclusive.
Fractions are often the safest form for questions involving counters or cards. They reduce the risk of rounding errors and can usually be simplified exactly at the end.
Tree diagrams worked examples
Worked example 1: independent events
A biased coin has probability 0.70.70.7 of landing heads. It is tossed twice. Find the probability of getting exactly one head.
Because the first toss does not affect the second, the probabilities on both stages are:
P(H)=0.7,P(T)=0.3 P(H)=0.7,\qquad P(T)=0.3 P(H)=0.7,P(T)=0.3Exactly one head can occur through two routes:
H then T H\text{ then }T H then Tor
T then H T\text{ then }H T then HCalculate each route:
P(HT)=0.7×0.3=0.21 P(HT)=0.7\times0.3=0.21 P(HT)=0.7×0.3=0.21 P(TH)=0.3×0.7=0.21 P(TH)=0.3\times0.7=0.21 P(TH)=0.3×0.7=0.21Add the routes:
P(exactly one head)=0.21+0.21=0.42 P(\text{exactly one head})=0.21+0.21=0.42 P(exactly one head)=0.21+0.21=0.42The key point is that “exactly one” includes both possible orders.
Worked example 2: selection without replacement
A bag contains 555 red counters and 333 blue counters. Two counters are selected at random without replacement. Find the probability that both counters are red.
There are 888 counters initially, so:
P(R first)=58 P(R\text{ first})=\frac{5}{8} P(R first)=85After a red counter is removed, 444 red counters remain out of 777 counters in total. Therefore:
P(R second∣R first)=47 P(R\text{ second}\mid R\text{ first})=\frac{4}{7} P(R second∣R first)=74Multiply along the red-red route:
P(RR)=58×47 P(RR)=\frac{5}{8}\times\frac{4}{7} P(RR)=85×74 P(RR)=2056=514 P(RR)=\frac{20}{56}=\frac{5}{14} P(RR)=5620=145Both the numerator and denominator change on the second branch because a red counter has been removed.
Worked example 3: at least one event
A machine produces a defective item with probability 0.040.040.04. Two items are selected independently. Find the probability that at least one is defective.
It is possible to add the probabilities of defective-defective, defective-not defective and not defective-defective. However, it is shorter to use the complement.
The opposite of “at least one defective” is “no defective items”. The probability that one item is not defective is:
1−0.04=0.96 1-0.04=0.96 1−0.04=0.96Therefore:
P(no defective items)=0.96×0.96=0.9216 P(\text{no defective items})=0.96\times0.96=0.9216 P(no defective items)=0.96×0.96=0.9216So:
P(at least one defective)=1−0.9216=0.0784 P(\text{at least one defective})=1-0.9216=0.0784 P(at least one defective)=1−0.9216=0.0784For “at least one” questions, calculating the complement is often more efficient because it uses only one route.
Embedded exam-style question
A box contains 666 green pens and 444 black pens. A student takes two pens at random without replacement.
Find the probability that the two pens are different colours. Give your answer as a fraction in its simplest form.
The valid routes are green then black and black then green:
P(GB)=610×49=2490 P(GB)=\frac{6}{10}\times\frac{4}{9}=\frac{24}{90} P(GB)=106×94=9024 P(BG)=410×69=2490 P(BG)=\frac{4}{10}\times\frac{6}{9}=\frac{24}{90} P(BG)=104×96=9024Add the two routes:
P(different colours)=2490+2490 P(\text{different colours})=\frac{24}{90}+\frac{24}{90} P(different colours)=9024+9024 P(different colours)=4890=815 P(\text{different colours})=\frac{48}{90}=\frac{8}{15} P(different colours)=9048=158Answer: 815\frac{8}{15}158
Try 4 more tree diagram practice questions, then use the answers to identify whether any errors came from the branch probabilities, multiplication or addition.
Four more tree diagrams exam questions
Question 1
The probability that Aisha wins a game is 0.650.650.65. She plays two independent games. Find the probability that she wins both games.
Question 2
A bag contains 777 white counters and 555 purple counters. Two counters are selected without replacement. Find the probability that both are purple.
Question 3
The probability that a seed germinates is 0.80.80.8. Two seeds are planted, and their outcomes are independent. Find the probability that exactly one seed germinates.
Question 4
A box contains 333 yellow balls and 555 blue balls. Two balls are selected without replacement. Find the probability that at least one ball is yellow.
Answers
- Multiply along the win-win route:
- The second denominator is 111111 because one counter has been removed:
- Exactly one germinating seed has two possible orders:
- Use the complement, which is selecting two blue balls:
Common mistakes in tree diagram questions
Adding along a route
Probabilities along one route must be multiplied, not added. Addition is used only to combine separate routes that satisfy the required event.
Keeping probabilities unchanged without replacement
If an object is not replaced, the total number of objects decreases. The second-stage denominator must change, and one numerator may change as well.
Changing both numerators automatically
Suppose a bag contains red and blue counters, and a red counter is removed. The number of red counters decreases, but the number of blue counters does not. Update each branch from the actual contents remaining rather than following a memorised pattern.
Missing a valid order
“Exactly one red” usually includes red-blue and blue-red. Unless the order is fixed by the wording, list every sequence that meets the condition.
Confusing “at least one” with “exactly one”
Exactly one excludes the outcome where both events occur. At least one includes one or more, so in a two-stage problem it includes exactly one and both.
Rounding too early
Keep exact fractions throughout the calculation when possible. If a decimal answer is required, round only after completing all multiplication and addition.
Higher-tier exam advice
Read the context before calculating. The phrase with replacement means that the original probabilities are restored, while without replacement creates dependent events.
When a diagram is partly completed, check each pair of branches independently. The probabilities leaving every branching point must add to 111, but probabilities from unrelated points do not need to add together.
For a three-stage tree, the rules do not change. Multiply three probabilities along each complete route, then add all routes matching the event. There are more outcomes, so organised labelling becomes increasingly important.
Tree diagrams may also contain algebraic probabilities. The same rules apply: branches from one point total 111, and complete routes are found by multiplication. If the question gives an overall probability, form an equation from the relevant routes and solve it.
You can compare this topic with the broader Higher-tier content list in the GCSE Maths topics by exam board and tier guide.
Conclusion
For Higher GCSE tree diagrams, remember three central ideas: probabilities leaving the same point add to 111, probabilities along a route are multiplied, and probabilities from separate valid routes are added. You must also decide whether replacement keeps the events independent or no replacement makes them dependent.
Practise drawing and completing the diagram before attempting more compressed solutions. MathsGenie practice questions and mark schemes can then help you check the method as well as the final answer.


