Sequential Experiments and Tree Diagrams
What you'll learn: How to visualize and calculate probabilities in multi-stage random experiments using tree diagrams.
The Core Idea
When an experiment unfolds in stages—like flipping a coin twice, or drawing cards one after another—a tree diagram lets you map out every possible path from start to finish. Each branch represents an outcome at one stage, and the probability of that outcome labels the branch. By multiplying probabilities along a path, you find the probability of that complete sequence.
Why Tree Diagrams Work
Recall the Multiplication Rule: P(A ∩ B) = P(A) · P(B|A). In a sequential experiment, the first stage gives outcome A, then the second stage gives outcome B given A happened. A tree diagram organizes this visually:
- First-stage branches show all possible outcomes and their probabilities
- Second-stage branches emanate from each first-stage outcome, labeled with conditional probabilities
- Path probabilities are found by multiplying along branches from root to leaf
Example Structure
Imagine drawing two cards without replacement from {Red, Blue}:
Start
/ \
R(1/2) B(1/2)
/ \
B(1) R(1)
- Path "Red then Blue": (1/2) × 1 = 1/2
- Path "Blue then Red": (1/2) × 1 = 1/2
With more complex setups (three stages, or cards with replacement), the tree grows but the principle stays identical: multiply along branches, add across paths that satisfy your event.
When to Use Trees
Tree diagrams shine when:
- Experiments have clear stages
- You need to track order of outcomes
- Conditional probabilities change at each stage
- You want to visualize all possibilities at once
Key Takeaway: Tree diagrams systematically organize sequential experiments by branching at each stage; multiply probabilities along any path to find that sequence's probability, leveraging the multiplication rule at each node.