A tree diagram represents a finite, multistage random experiment by showing each possible result as a branch at the appropriate stage; each complete path from the initial point to an endpoint represents one outcome in the sample space, while intermediate branches do not. The representation makes outcomes exhaustive and non-overlapping and can display branch probabilities, including changing probabilities for dependent stages, supporting path-based probability calculations. Continuous sample spaces and more advanced combinatorial generalizations are not included.
On this page:
A tree diagram shows the possible results of a random experiment in stages.
A bag contains red counters and blue counters. Two counters are drawn without replacement. The color of each counter is recorded.
The first counter can be:
The probabilities for the second draw depend on the first draw because the first counter is not replaced.
If the first counter is red, then red and blue counters remain:
If the first counter is blue, then red and blue counter remain:
The tree can be represented as:
Start
├── Red, 1/2
│ ├── Red, 1/3 → RR
│ └── Blue, 2/3 → RB
└── Blue, 1/2
├── Red, 2/3 → BR
└── Blue, 1/3 → BB
The sample space is the set of complete paths:
The single letters at the first branches are not outcomes because they do not describe both draws.
To find the probability of a complete path, multiply the probabilities along that path:
For example, the probability of drawing one red and one blue is found by adding the two relevant paths:
Thus, tree diagrams help you list every complete outcome exactly once and calculate probabilities by multiplying along paths and adding suitable paths.
Click a topic below to practice the foundational skills you'll need, learn the steps, or master this skill
Earned ?
Print this free 'Represent sample spaces using tree diagrams' worksheet to practice this skill away from the computer. Click 'Modify' to easily customize this worksheet to your exact needs.