What is the difference between $P(B|A)$ and $P(A \cap B)$ in the context of a tree diagram?

$P(B|A)$ is the conditional probability found on a single branch in the second stage of the tree. $P(A \cap B)$ is the intersection probability calculated by multiplying the first-stage branch $P(A)$ by the second-stage branch $P(B|A)$.

When should you use a tree diagram instead of a Venn diagram?

Tree diagrams are best for sequential events or multi-stage experiments where the outcome of one stage affects the next. Venn diagrams are better suited for static situations where you need to see the overlap between sets without a specific order.

How does 'sampling without replacement' affect the construction of a tree diagram?

It makes the events dependent, meaning the probabilities on the second stage of branches must be updated. Specifically, the denominator (total items) decreases by one, and the numerator may also decrease if the same category was selected in the first stage.

What is the most common error when calculating the total probability of an event from a tree?

The most common error is failing to identify all possible paths that lead to the desired outcome. Students often calculate only one path and forget that the event might occur through different sequences of prior events.

What happens if you add probabilities along a path instead of multiplying them?

Adding probabilities along a path is a conceptual error because the path represents the intersection of events (Event 1 AND Event 2). In probability, 'AND' logic for independent or dependent sequences requires multiplication to find the joint probability.

Why is it a mistake to assume the second-stage branches are identical to the first-stage branches?

This assumes the events are independent. In many real-world scenarios (like drawing items from a bag), the first event changes the composition of the sample space, which alters the probabilities for the second event.

Define 'Conditional Probability' in the context of a tree diagram.

It is the probability of an event occurring on a specific branch, given that the path leading to that branch has already occurred. It is represented by the labels on all branches after the first stage.

What is the 'Law of Total Probability'?

It is a fundamental rule stating that the total probability of an event is the sum of the probabilities of all the distinct ways that event can happen. In a tree, this means adding the results of all paths that end in that event.

What does a 'node' represent in a tree diagram?

A node represents a point in time or a stage in the experiment where multiple outcomes are possible. From each node, branches emerge to represent every possible next step in the sequence.

Why must the branches from a single node always sum to 1?

Because the branches from a node represent an exhaustive and mutually exclusive set of all possible outcomes for that stage. Since one of those outcomes must occur, their combined probability must be 100% or 1.

Library Podcasts

Courses

Referral & Rewards

Revision Notes

AS-Level

Cambridge International Examinations

Maths

Probability And Statistics 1

Probability

Tree Diagrams with Conditional Probability

Summary

Tree diagrams are visual tools used to represent multi-stage probability experiments where the outcome of one event may influence the probability of subsequent events. They provide a systematic framework for calculating intersections and total probabilities by mapping out every possible sequence of outcomes and their associated conditional probabilities.

1. Definition & Core Concepts

A tree diagram is a graphical representation of a sequence of events, where each 'branch' represents a possible outcome and each 'node' represents a point of decision or chance.

The first set of branches represents the primary events (e.g., Event $A$ and its complement $A'$ ), while subsequent sets represent conditional events that occur after the first event has been resolved.

In a conditional tree, the probabilities on the second stage of branches are conditional probabilities, denoted as $P(B|A)$ , which represents the probability of event $B$ occurring given that event $A$ has already occurred.

Every set of branches originating from a single node must have probabilities that sum exactly to $1$ , as they represent the exhaustive set of possibilities for that specific stage.

A two-stage tree diagram showing Event A and A' in the first stage, followed by conditional events B and B' in the second stage with appropriate probability notation.

2. Underlying Principles

3. Methods & Techniques

4. Key Distinctions

5. Exam Strategy & Tips

6. Common Pitfalls & Misconceptions

Tree Diagrams with Conditional Probability

Summary

1. Definition & Core Concepts

A tree diagram is a graphical representation of a sequence of events, where each 'branch' represents a possible outcome and each 'node' represents a point of decision or chance.

Every set of branches originating from a single node must have probabilities that sum exactly to $1$ , as they represent the exhaustive set of possibilities for that specific stage.

A two-stage tree diagram showing Event A and A' in the first stage, followed by conditional events B and B' in the second stage with appropriate probability notation.

2. Underlying Principles

The Multiplication Rule states that to find the probability of a specific sequence of events (the intersection), you must multiply the probabilities along the path. For example, $P(A \cap B) = P(A) \times P(B|A)$ .

The Law of Total Probability is applied by summing the probabilities of all distinct paths that lead to a specific final outcome. If event $B$ can happen via path $A$ or path $A'$ , then $P(B) = P(A \cap B) + P(A' \cap B)$ .

Tree diagrams inherently account for dependent events, such as sampling without replacement, where the denominator of the probability fraction decreases after each selection.

If events are independent, the conditional probability $P(B|A)$ is simply equal to $P(B)$ , meaning the branches in the second stage will look identical regardless of the first stage outcome.

3. Methods & Techniques

Step 1: Construct the First Stage

Identify the initial events and their probabilities. Draw branches from a starting node and label each with the event name and its probability.

Step 2: Construct Subsequent Stages

For each outcome in the first stage, draw a new set of branches. These represent the outcomes of the next event given the previous outcome occurred.

Step 3: Calculate Path Intersections

Multiply the probabilities along each individual path from left to right. The result at the end of each path represents the probability of that specific combination of events occurring ( $P(A \cap B \cap C)$ ).

Step 4: Calculate Total Event Probability

To find the total probability of a specific outcome (e.g., 'getting at least one red ball'), identify all paths that satisfy the condition and add their intersection probabilities together.