Tree diagrams provide a clear way to organize probability problems that unfold in stages.
They represent sequential randomness through branches and paths, making conditional relationships explicit and traceable. By following paths through the diagram, probabilities of complex outcomes can be computed in a structured and transparent way.
Tree diagrams connect naturally to conditional probability, the law of total probability, and Bayes' theorem, serving as a visual bridge between models, rules, and calculations.
| Concept |
How the tree represents it |
| Joint probability of a sequence |
multiply the branch probabilities along the path from root to terminal node |
| Marginal probability of a later event |
sum the path probabilities over every path that ends in that event |
| Conditional probability |
each branch label is itself a conditional probability, given everything that came before |
| Law of total probability |
sum contributions across the disjoint first-level branches that partition the process |
| Bayes' theorem |
read backward — keep only the paths consistent with the observation and renormalize their probabilities |
| Best for |
sequential outcomes, few stages, dependencies between stages, central conditional probability |
| Less suitable when |
many stages, many outcomes per stage, parallel events without natural order |