A tree diagram represents a finite sample space for a compound experiment by showing each possible outcome at each stage, with complete paths from the first branch to the final result representing individual outcomes. It supports systematic enumeration, reveals whether outcomes have been omitted or repeated, and connects the number of equally likely paths to probability calculations; more advanced cases involving dependent or conditional probabilities are not included here.
A tree diagram lists the possible results of a multi-step experiment. Each branch shows one possible result at a stage, and each complete path from start to finish represents one outcome in the sample space.
Example: A fair coin is tossed twice. What is the sample space, and what is the probability of getting exactly one head?
Start
├── H
│ ├── H → HH
│ └── T → HT
└── T
├── H → TH
└── T → TT
The sample space is
There are equally likely complete paths. The outcomes with exactly one head are and , so there are successful outcomes.
Therefore,
To check your tree, make sure every possible result is included once and that every outcome is a complete path from the start to the end.
Click a topic below to practice the foundational skills you'll need, learn the steps, or master this skill
Earned ?