Two-Stage Tree Diagrams
≈ 25 minTwo-Stage Tree Diagrams
A tree diagram organises sequential outcomes; multiply along a path and add disjoint paths. Branch probabilities from each node must sum to 1. A careful solution names the quantities, keeps place value or units visible, and explains why each operation fits.
Worked reasoning
- The paths HT and TH each have probability .
- Add .
A fair coin is tossed twice. Find the probability of exactly one head.
Which statement best captures the central mathematical idea in Two-Stage Tree Diagrams?
When starting a problem about Two-Stage Tree Diagrams, which move is most reliable?
Which statement is a misconception that must be rejected when working with Two-Stage Tree Diagrams?

