GCSE · Maths · OCR · Spec J560

Tree diagrams

Two marbles from a bag. Two days of weather. Two games. When things happen in stages, the chances branch out — and a tree diagram shows every route at once.

Maths · Probability

Two marbles, one bag

Switch between putting the first marble back and keeping it out. Then pick a row to light up its path.

A bag holds 6 marbles: 4 green and 2 yellow. You take one marble, then a second.

1st draw2nd draw4/62/64/62/64/62/6GYGYGYGGGYYGYY4G · 2Y4G2Y

Back in the bag: the second draw looks exactly like the first — 4/6 green and 2/6 yellow in both groups — so the second draw is independent of the first. The four paths add to 36/36 = 1.

Tap a row

Tap an outcome row — the two branches on its path glow indigo and the multiplication is laid out.

Watch out: Never add along a path. Green then green kept out is 4/6 × 3/5 = 12/30, not 4/6 + 3/5 — that sum is bigger than 1, and no probability can be.

Predict, then check

Two at once sounds like a different situation. Is it?

Maya grabs two socks at the same time from a drawer of 8 socks: 5 black and 3 white. On a tree for this, what is the denominator on the second-draw branches?

When stage 2 depends on stage 1

Reading a weather tree
Day 1Day 2Path0.30.7RainNo rain0.60.40.20.8RainNo rainRainNo rain0.180.120.140.56

Showing 1 layer: Weather tree

Explore

Pick a part of the tree to see what it tells you.

Day 1 then day 2. The day-2 chances depend on what day 1 did.

Two words people mix up

Independent or mutually exclusive?

Same weather tree: day 1 is rain or no rain, then day 2 is rain or no rain. After rain the day-2 pair is 0.6 and 0.4; after no rain it is 0.2 and 0.8.

Which of these is closest to what you think right now?
How sure are you?

Find the slip

A result bigger than certain

Priya hits the target with probability 0.7 on each shot, and her shots are independent. Find the probability that she hits with both of her two shots.

Sam's answer — which line goes wrong?

Your turn to fill the gaps

At least one win

Leo plays two games of chess. P(he wins game 1) = 0.6. If he wins game 1, P(he wins game 2) = 0.55. If he doesn't win game 1, P(he wins game 2) = 0.3. Find P(Leo wins at least one game).

  1. Game 1: win 0.6, so not win = 1 − 0.6 = 0.4.
  2. missing step
Which line is step 2?

WHAT YOU'VE LEARNED

A quick recap of today's lesson.

One layer per stage, a probability on every branch

What you need to know

  • Each branch shows one outcome of a stage, with its probability written on the branch.
  • Each new layer is the next stage, and it grows out of every outcome before it.
  • You can branch on events, like 'square number' and 'not square number', instead of every single outcome.
  • Branches leaving the same point always add up to 1, so a missing one is 1 minus the others.
  • Have a goZak's tree has 0.15 on the 'late' branch, so he confidently writes 0.5 on 'not late' — 'there are only two options'. What should it say?

    0.85

    Branches from one point add to 1, so 'not late' is 1 − 0.15. Two branches doesn't make them 50:50 — that only happens when both are equally likely.

  • Multiply along a path for a combined outcome — adding along it can top 1, and no probability can.
  • Have a goA path has 0.5 on its first branch and 0.4 on its second. Multiply or add — and what do you get?

    Multiply: 0.5 × 0.4 = 0.2

    A path means both things happen, so you multiply. Adding gives 0.9, far bigger than the chance of both happening.

  • For an event like 'at least one', add the probabilities of every path that counts.
  • All the end-of-path probabilities add up to 1: a quick check, easier with a common denominator.
  • Without replacement there's one fewer object, so second-draw denominators drop by 1 and numerators depend on the first pick.
  • Have a goA bag has 3 red and 2 blue counters. You take a red and keep it. What's the probability the next counter is red?

    2/4

    One counter fewer, so the denominator is 4; one red has gone, so 2 reds are left. 3/5 would be right only if the red went back.

  • Same probabilities in every second-layer group? Independent. Different ones? The second stage depends on the first.
  • A 'given' probability is just a branch: follow the known first outcome, then read the next branch.

The big picture

A probability tree shows each stage of a trial as a layer of branches, with the probability of each outcome written on its branch. Multiply along a path to get the probability of that combined outcome, and add the paths you need for an event such as 'at least one'. Every group of branches leaving one point adds up to 1, and so do all the end-of-path probabilities together. When the second stage depends on the first — as it does when you take things without replacement — the second-layer probabilities change from one group to the next.

Key points

1One layer of branches per stage; the probability of each outcome goes on its branch.
2Branches from one point add to 1, and all the end-of-path probabilities add to 1.
3Combined outcome: multiply along the path, P(A and C) = P(A) × P(C given A).
4An event made of several paths, such as 'at least one': add those paths.
5Without replacement: second-stage denominators fall by 1, even when two items are taken at once.
6Second-layer groups all the same: independent. Groups that differ: dependent.

Worked example

Problem

A bag holds 10 counters: 7 blue and 3 red. Two counters are taken out at the same time. Find the probability that both counters are the same colour.

⚠ Watch out

Changing the denominator but not the numerator. After a blue counter has been taken, there is one fewer blue as well as one fewer counter, so the next blue branch is 6/9, not 7/9.

🧠

Memory hook

Along a path, multiply. Across the paths you want, add. Every fork adds up to 1.

✓

Check yourself

A seed sprouts with probability 0.8, and two seeds sprout independently of each other. What is the probability that exactly one of them sprouts? (Answer: 0.8 × 0.2 + 0.2 × 0.8 = 0.32.)

Flashcards

(14)
What does each branch of a probability tree show?
One possible outcome of that stage, with the probability of that outcome written on the branch.
What does each layer of branches stand for?
One stage of the trial. Every branch in the next layer grows out of one outcome of the stage before.
Why might a tree use 'square number' and 'not square number' instead of every outcome?
Branching on events instead of individual outcomes needs fewer branches.
Branches leaving one point add up to what — and why?
1. They are mutually exclusive (only one can happen) and exhaustive (one of them must happen).
How do you get the probability of a combined outcome, like heads then tails?
Multiply the probabilities on the branches along that path.
Why is adding along a path wrong?
It can give a total above 1, and no probability can be bigger than 1.
How do you find P(at least one) from a tree?
Add the probabilities of every path that includes at least one.
What do all the end-of-path probabilities add up to?
1 — they cover the whole sample space. Use it as a check; a common denominator makes it easier.
Two counters are taken at once from 12. What is the second-draw denominator?
11. Treat it as one counter, then another: the denominator drops by 1, not 2.
Without replacement, what decides the second-stage numerators?
What was taken first: there is one fewer of that kind left.
How can a tree show that the second stage is independent of the first?
Every group of second-layer branches has the same probabilities, whatever happened at the first stage.
What does 'mutually exclusive' mean?
The events have no outcomes in common, so they can't both happen.
How do you read P(rain on day 2 given no rain on day 1) from a tree?
Follow the 'no rain' branch for day 1, then read the 'rain' branch that comes after it.
Write the rule for two dependent stages A then C.
P(A and C) = P(A) × P(C given A).

Tap any card to flip it, or use Study as deck to go through them one at a time. In the full lesson these run as a spaced-repetition deck — you rate each card Hard, Good or Easy and the tricky ones keep coming back until they stick.

Learning with Lightbulb is opening soon

You can use this lesson now. Join the waitlist and we'll let you know when the full Lightbulb experience is ready.

Keep me posted

More OCR GCSE Maths topics

See the full OCR Maths curriculum →

How this lesson was checked. This OCR GCSE Maths (specification J560)lesson was published through Lightbulb Learning's human-designed editorial process — the educational standards, accuracy rules and publication checks it must pass were authored and approved by Philip Halpin. It passed subject-specific assessment, automated educational checks and technical publication verification before going live (publication checks completed 8 November 2026). Published pages are monitored, human spot-checking is ongoing across the lesson library, and anything found wrong is corrected or withdrawn. How our lessons are made and checked. Spotted a mistake? Email hello@lightbulblearning.co and we'll review it.

Helpful guides for parents and students