Probability tree diagrams organize multi-step chance events by showing each possible outcome as a branch. They are useful because many real situations happen in stages, such as drawing counters, tossing coins, or choosing cards. A tree makes it easier to see all possible paths and avoid missing outcomes.
It also connects naturally to the basic rules for multiplying and adding probabilities.
Understanding Statistics: Probability Tree Diagrams
A tree diagram has a starting point called the root. Each split represents one stage of the experiment. The end of a complete route is called an outcome path.
Reading from left to right helps keep the time order clear. This matters because the result at an earlier stage can change what is possible later. Suppose a bag contains three red counters and two blue counters.
If one counter is removed and not put back, the second draw takes place from only four counters. A branch after a red first draw must therefore use the new contents of the bag, not the original counts.
The number written on a later branch is a conditional probability. It means the chance of that result under the condition that the path has already reached that point. Students often make errors by copying probabilities from the first split onto every later split.
That only works when the stages do not affect one another. Tossing a coin twice is an example. The first toss does not alter the coin, so the chance of heads remains one half on every second-toss branch.
Drawing cards from a deck without returning the first card is different. After a heart is drawn, there is one fewer heart and one fewer card in the deck.
A useful habit is to label each final path in words before doing any calculation. For two coin tosses, the four paths are heads then heads, heads then tails, tails then heads, and tails then tails. This list shows that getting exactly one head can happen in two different ways.
Each route has its own chance, and both routes belong to the final event. Students need to include every route that fits the wording.
In contrast, getting heads on both tosses has only one route. Words such as exactly, at least, at most, one or more, and not are important because they tell you which end paths to collect.
Tree diagrams are useful outside textbook questions because many decisions happen in sequence. A medical screening result may depend on whether a person has a condition, followed by whether the test gives a positive or negative result. A shop may track whether a customer sees an advert, then clicks it, then buys an item.
In these cases, a branch can show that a later chance differs for different groups. This is why a tree can reveal misleading assumptions.
A high chance on one branch does not mean the same chance for the whole population. The earlier branches affect how many cases reach each later branch.
Check a completed tree in two ways. At every split, the outgoing probabilities should account for every possible next result. Then the probabilities of all final paths together should make one whole experiment.
If either check fails, an outcome may be missing or a value may have been changed incorrectly. Keep fractions where possible until the final step, since early rounding can create small errors. Finally, separate the event named in the question from the path used to find it.
A path is one specific history. An event can contain one path or several paths, depending on the condition given.
Key Facts
- For a path through a tree, multiply branch probabilities: P(A and B) = P(A) × P(B given A).
- To combine separate paths that lead to the same final event, add their probabilities: P(path 1 or path 2) = P(path 1) + P(path 2).
- The probabilities on all branches leaving the same node must add to 1.
- With replacement, probabilities usually stay the same from one stage to the next.
- Without replacement, probabilities often change because the total number of items and the number of favorable items change.
- For independent events, P(B given A) = P(B), so P(A and B) = P(A) × P(B).
Vocabulary
- Probability tree diagram
- A branching diagram that shows all possible outcomes of a multi-stage probability experiment.
- Branch
- A line in a probability tree that represents one possible outcome at a stage.
- Path
- A complete route from the start of a tree to a final outcome.
- With replacement
- A situation where an item is put back before the next selection, so the probabilities may stay the same.
- Without replacement
- A situation where an item is not put back before the next selection, so later probabilities may change.
Common Mistakes to Avoid
- Adding along a single path is wrong because a path represents events happening together. Multiply the branch probabilities to find the probability of that exact sequence.
- Forgetting to change probabilities without replacement is wrong because the contents of the group have changed after the first selection. Update both the favorable count and the total count.
- Adding probabilities from overlapping paths is wrong because it can count the same outcome more than once. Only add separate, mutually exclusive paths unless you correct for overlap.
- Leaving branch probabilities that do not add to 1 is wrong because each set of branches from one node should include all possible outcomes at that stage. Check each split before calculating final probabilities.
Practice Questions
- 1 A bag has 3 red counters and 2 blue counters. One counter is drawn, replaced, and a second counter is drawn. Use a probability tree to find P(red then blue).
- 2 A bag has 4 green counters and 3 yellow counters. Two counters are drawn without replacement. Use a probability tree to find P(two yellow counters).
- 3 A student says that replacement does not matter in a probability tree because the same colors are still possible on the second draw. Explain why this reasoning is incomplete.