Building a tree diagram
Each branch = an outcome. Each branch labelled with its probability.
A tree diagram shows all outcomes of a sequence of events.
Structure:
- Start from a single point.
- First "level" of branches: outcomes of the first event.
- From each first-level node, draw second-level branches: outcomes of the second event.
- Each branch has a probability label.
Example. Two coins.
0.5 H ─── 0.5 H (HH)
│ 0.5 T (HT)
│
0.5 T ─── 0.5 H (TH)
0.5 T (TT)
Rule. Probabilities of branches from any single node SUM to 1.
Worked example. Bag: 3 red, 5 blue. Pick two WITHOUT replacement.
First level: , .
After picking red: 2 red and 5 blue (7 total) remain. After picking blue: 3 red and 4 blue (7 total) remain.
Second level:
- After : , .
- After : , .
Note: the second-level probabilities DEPEND on what happened first. With replacement, they would all be the same.
Edexcel tip. Lay out the tree clearly, with probabilities written ON the branches. Mark schemes credit a fully-labelled tree even before computation.
- Branches show outcomes.
- Each branch = probability.
- Branches from a node sum to 1.
- Without replacement → second probabilities change.