Tree Diagrams: Complete Guide with Exercises and Detailed Summary

Master tree diagrams: principles, methods, and their role in visualizing and calculating probabilities through detailed examples and exercises.

Exercises 1 to 3: Solutions
1 Basic Tree Diagram
Exercise 1
A coin is flipped twice. Draw a tree diagram showing all possible outcomes and calculate the probability of getting exactly one head.
Key Definition:

Tree Diagram: A visual representation of all possible outcomes of a multi-stage experiment, showing each branch as a possible outcome at each stage.

Tree Diagram Construction:
  1. Stage 1: Draw branches for first flip (H, T)
  2. Stage 2: From each Stage 1 outcome, draw branches for second flip (H, T)
  3. Label Branches: Write probabilities on each branch
  4. Calculate Path Probabilities: Multiply along each path
  5. Sum Relevant Paths: Add probabilities for desired outcomes
Step 1: Draw tree diagram structure

Start → H → H (HH), Start → H → T (HT), Start → T → H (TH), Start → T → T (TT)

Step 2: Label probabilities

Each branch has probability 1/2

Step 3: Calculate path probabilities

P(HH) = 1/2 × 1/2 = 1/4, P(HT) = 1/2 × 1/2 = 1/4, P(TH) = 1/2 × 1/2 = 1/4, P(TT) = 1/2 × 1/2 = 1/4

Step 4: Identify outcomes with exactly one head

HT and TH each have exactly one head

P(exactly one head) = P(HT) + P(TH) = 1/4 + 1/4 = 1/2
Final Answer:

Sample space: {HH, HT, TH, TT}. P(exactly one head) = 1/2.

Key Rules:

• Multiplication Rule: Multiply probabilities along each path

• Addition Rule: Add probabilities of mutually exclusive outcomes

• Complete Sample Space: Tree diagrams show all possible outcomes

Tip: Always ensure all paths from root to leaves represent complete outcomes.
2 Conditional Probability Tree
Exercise 2
A bag contains 4 red and 6 blue marbles. Two marbles are drawn without replacement. Draw a tree diagram and find the probability that both marbles are red.
Key Definition:

Conditional Probability in Trees: Probabilities on later branches depend on outcomes of earlier branches.

Step 1: Draw first stage branches

Red: 4/10, Blue: 6/10

Step 2: Draw second stage branches (without replacement)

After drawing red: Red: 3/9, Blue: 6/9

After drawing blue: Red: 4/9, Blue: 5/9

Step 3: Calculate path probability for both red

P(Red then Red) = 4/10 × 3/9 = 12/90 = 2/15

Step 4: Verify all probabilities sum to 1

P(RR) + P(RB) + P(BR) + P(BB) = 12/90 + 24/90 + 24/90 + 30/90 = 90/90 = 1 ✓

P(both red) = 2/15 ≈ 0.133
Final Answer:

The probability of drawing two red marbles is 2/15 ≈ 0.133.

Key Rules:

• Adjust Probabilities: Update denominators after each draw

• Conditional Probabilities: Second stage probabilities depend on first stage outcomes

• Verification: All final probabilities should sum to 1

Tip: Always update the total number of items when drawing without replacement.
3 Multi-Stage Tree
Exercise 3
A game involves spinning a wheel with 3 equal sections (red, blue, green) followed by rolling a fair die. Draw a tree diagram and find the probability of getting red on the wheel AND an even number on the die.
Key Definition:

Multi-Stage Tree: A tree diagram with more than two levels of branches, representing sequential experiments.

Step 1: Draw first stage (wheel spin)

Red: 1/3, Blue: 1/3, Green: 1/3

Step 2: Draw second stage (die roll) from each first stage outcome

From each wheel result: 1, 2, 3, 4, 5, 6 (each with probability 1/6)

Step 3: Identify favorable outcomes

Red and even: (Red, 2), (Red, 4), (Red, 6)

Step 4: Calculate probability

P(Red and even) = P(Red,2) + P(Red,4) + P(Red,6) = (1/3 × 1/6) + (1/3 × 1/6) + (1/3 × 1/6) = 3/18 = 1/6

P(Red and even) = 1/6 ≈ 0.167
Final Answer:

The probability of getting red on the wheel and an even number on the die is 1/6 ≈ 0.167.

Key Rules:

• Sequential Multiplication: Multiply probabilities along each complete path

• Independent Stages: When stages are independent, use multiplication rule

• Path Counting: Each path from root to leaf represents one complete outcome

Tree Diagram Fundamentals and Structure
\(P(\text{path}) = \prod_{i=1}^{n} P(\text{stage } i)\)
Path Probability Formula
Tree Diagram Components
Root Node: Starting point of the tree
Branches: Lines representing possible outcomes
Nodes: Points where branches split
Leaves: End points representing final outcomes
Probability Rules
Multiplication Rule: P(path) = product of probabilities along path
Addition Rule: P(event) = sum of probabilities of paths in event
Sum Rule: All final probabilities sum to 1
Conditional Rule: Later probabilities may depend on earlier outcomes
Root
→
Stage 1
→
Stage 2
→
Final Outcome
Key Terms: Root (starting point), Node (decision point), Branch (outcome path), Leaf (final outcome), Path (complete sequence)
Mathematical Foundation: Based on multiplication and addition rules of probability
Exercises 4 to 5: Solutions
4 Medical Testing Tree
Exercise 4
A medical test has 95% accuracy. If 1% of the population has the disease, draw a tree diagram and find the probability that someone tests positive. Then find P(has disease | tests positive).
Key Definition:

Medical Testing Tree: A tree diagram showing the relationship between disease status and test results.

Step 1: Define events and probabilities

P(disease) = 0.01, P(no disease) = 0.99

P(positive | disease) = 0.95, P(negative | disease) = 0.05

P(positive | no disease) = 0.05, P(negative | no disease) = 0.95

Step 2: Draw tree diagram

First branch: Disease (0.01) vs No Disease (0.99)

Second stage: Positive/Negative from each first stage

Step 3: Calculate P(tests positive)

P(positive) = P(positive and disease) + P(positive and no disease)

= (0.01 × 0.95) + (0.99 × 0.05) = 0.0095 + 0.0495 = 0.059

Step 4: Apply Bayes theorem for conditional probability

P(disease | positive) = P(positive | disease) × P(disease) / P(positive)

= (0.95 × 0.01) / 0.059 = 0.0095 / 0.059 ≈ 0.161

P(tests positive) = 0.059, P(has disease | tests positive) ≈ 0.161
Final Answer:

P(tests positive) = 0.059. P(has disease | tests positive) ≈ 0.161.

Applied Rules:

• Law of Total Probability: P(positive) = sum of all paths to positive

• Bayes Theorem: Use tree structure to apply conditional probability

• Base Rate: Consider prevalence when interpreting test results

5 Game Tree Analysis
Exercise 5
In a game, Player A wins the first round with probability 0.6. If A wins the first round, A wins the second round with probability 0.7. If A loses the first round, A wins the second round with probability 0.4. Draw a tree diagram and find the probability that A wins exactly one round.
Key Definition:

Game Tree: A tree diagram showing possible outcomes in sequential game rounds with conditional probabilities.

Step 1: Draw first round branches

A wins round 1: 0.6, A loses round 1: 0.4

Step 2: Draw second round branches

From A wins round 1: A wins round 2 (0.7), A loses round 2 (0.3)

From A loses round 1: A wins round 2 (0.4), A loses round 2 (0.6)

Step 3: Identify outcomes with exactly one win

A wins round 1 and loses round 2: (0.6 × 0.3) = 0.18

A loses round 1 and wins round 2: (0.4 × 0.4) = 0.16

Step 4: Calculate total probability

P(exactly one win) = 0.18 + 0.16 = 0.34

P(exactly one win) = 0.34
Final Answer:

The probability that A wins exactly one round is 0.34.

Applied Rules:

• Conditional Probabilities: Second round probabilities depend on first round outcomes

• Mutually Exclusive Events: Add probabilities of mutually exclusive outcomes

• Path Multiplication: Multiply along each complete path to get outcome probability

Detailed Summary: Tree Diagrams
\(P(\text{event}) = \sum_{\text{paths in event}} P(\text{path})\)
Event Probability Formula
Core Definitions:

Tree Diagram: A graphical representation of all possible outcomes of a multi-stage experiment, where each branch represents a possible outcome at each stage.

Root Node: The starting point of the tree diagram.

Branch: A line segment representing a possible outcome at a particular stage.

Node: A point where the tree splits into different branches.

Leaf: An endpoint of the tree representing a complete sequence of outcomes.

Path: A continuous route from root to leaf representing one complete outcome.

Tree Diagram Construction Process:
  1. Identify Stages: Determine the sequential stages of the experiment
  2. Draw Root: Start with the initial state
  3. First Stage: Draw branches for all possible outcomes of the first stage
  4. Subsequent Stages: From each outcome of previous stage, draw branches for next stage
  5. Label Probabilities: Write probability of each branch on the branch
  6. Calculate Path Probabilities: Multiply probabilities along each complete path
  7. Identify Events: Determine which paths correspond to the event of interest
  8. Sum Relevant Paths: Add probabilities of paths in the event
Tip 1: Always ensure the probabilities from any node sum to 1.
Tip 2: Use tree diagrams for sequential experiments with multiple stages.
Tip 3: Check that all final probabilities sum to 1 as a verification.
Tip 4: Tree diagrams are especially helpful for conditional probability problems.
Common Mistakes: Incorrect probability labeling, forgetting to update probabilities for dependent events, not considering all possible paths, miscalculating path probabilities.
Exam Focus: Constructing tree diagrams, calculating path probabilities, finding conditional probabilities, solving multi-stage probability problems.
Critical Principles:

• Visual Clarity: Tree diagrams make complex sequential problems clearer

• Systematic Approach: Ensures all outcomes are considered

• Probability Multiplication: Along each path, multiply probabilities

• Probability Addition: For events, add probabilities of relevant paths

• Verification: All final probabilities should sum to 1

\(\sum_{\text{all paths}} P(\text{path}) = 1\)
Probability Conservation Law

Questions & Answers

Question: When should I use a tree diagram instead of other probability methods? Are there situations where tree diagrams are better?

Answer: Tree diagrams are particularly useful for:

  • Sequential Experiments: Multiple stages with outcomes at each stage
  • Conditional Probability: When later probabilities depend on earlier outcomes
  • Complex Problems: When other methods become confusing
  • Visual Learners: When a picture helps understanding

Advantages:

  • Shows all possible outcomes systematically
  • Makes conditional probability clear
  • Reduces errors by organizing information visually

Use tree diagrams when you have multiple stages or when outcomes depend on previous results.

Question: How do I handle "with replacement" vs "without replacement" in tree diagrams? What's the difference?

Answer: The key difference is in how probabilities change:

  • With Replacement: Probabilities stay constant at each stage
  • Without Replacement: Probabilities change based on previous outcomes

Example (Drawing Marbles):

  • With replacement: Always 4 red out of 10 total → P(red) = 4/10 each time
  • Without replacement: After drawing red, 3 red out of 9 total → P(red) = 3/9

In tree diagrams, "without replacement" requires updating the numerator and denominator for each branch based on what has been drawn previously.

Question: How do I know if I've drawn the tree diagram correctly? Are there ways to verify it?

Answer: Here are verification methods:

  • Branch Sum Check: At each node, probabilities of all branches from that node should sum to 1
  • Total Probability Check: All final path probabilities should sum to 1
  • Logical Check: Ensure all possible outcomes are represented
  • Count Check: Verify you have the expected number of final outcomes

Example Verification:

Coin flip twice: Should have 4 final outcomes (HH, HT, TH, TT), each with probability 1/4, and 1/4 + 1/4 + 1/4 + 1/4 = 1 ✓

These checks help catch errors in construction or calculation.