Advanced Tree Diagram Applications: Modelling and Calculating Complex Probability Events | 树状图进阶应用：复杂概率事件的建模与计算

📚 Advanced Tree Diagram Applications: Modelling and Calculating Complex Probability Events | 树状图进阶应用：复杂概率事件的建模与计算

Tree diagrams are one of the most powerful visual tools in probability, allowing us to break down complex multi-stage events into clear, manageable branches. In this article, we will explore advanced techniques for constructing and interpreting tree diagrams, focusing on scenarios that frequently appear in Edexcel IGCSE examinations.

树状图是概率学中最强大的可视化工具之一，它能将复杂的多阶段事件分解为清晰、可管理的分支。在本文中，我们将深入探讨构建和解读树状图的高级技巧，重点关注 Edexcel IGCSE 考试中频繁出现的题型。

---

1. The Foundational Rules of Probability | 概率基础法则回顾

Before advancing to complex applications, we must firmly establish two essential rules. The addition rule states that for mutually exclusive events A and B, P(A or B) = P(A) + P(B). The multiplication rule states that for independent events A and B, P(A and B) = P(A) × P(B).

在深入高级应用之前，我们必须牢固掌握两条基本法则。加法法则指出，对于互斥事件 A 和 B，P(A 或 B) = P(A) + P(B)。乘法法则指出，对于独立事件 A 和 B，P(A 且 B) = P(A) × P(B)。

The probability of an event not occurring is given by P(not A) = 1 − P(A). This complementary rule is particularly useful when calculating probabilities of “at least one” scenarios, as we will see later.

事件不发生的概率为 P(非 A) = 1 − P(A)。这条补集法则在计算”至少一次”类概率时尤为实用，我们稍后将详细讨论。

P(A ∪ B) = P(A) + P(B) (mutually exclusive) | P(A ∩ B) = P(A) × P(B) (independent)

---

2. Constructing Tree Diagrams: Key Principles | 构建树状图：核心原则

Every tree diagram must follow a logical order that reflects the sequence of events. Each complete path from root to tip represents one combined outcome, and its probability is the product of the probabilities along that path. The sum of all path probabilities must equal exactly 1.

每个树状图都必须遵循反映事件顺序的逻辑结构。从根到末端的每条完整路径代表一个组合结果，其概率等于路径上各概率的乘积。所有路径概率之和必须恰好等于 1。

At each branching node, the probabilities of all outgoing branches must sum to 1, satisfying the complement rule. This provides an immediate check for arithmetic errors—if any node’s branches do not total 1, the diagram is incorrect.

在每个分支节点处，所有引出分支的概率之和必须等于 1，即满足补集法则。这为算术错误提供了即时检查——如果任何节点的分支概率之和不等于 1，则说明树状图有误。

For dependent events, the probabilities on the second and subsequent levels must reflect the changed conditions. This is best illustrated by “without replacement” problems, which we will examine in depth in Section 5.

对于相关事件，第二层及后续层级上的概率必须反映条件的变化。”不放回”类问题最能说明这一点，我们将在第 5 节深入探讨。

---

3. Independent Events: Two-Stage Modelling | 独立事件：两阶段建模

When two events are independent, the outcome of the first event has no effect on the probability of the second. A classic example is tossing a fair coin twice. Each branch on the second level carries the same probabilities (½ for heads, ½ for tails) regardless of the first toss result.

当两个事件相互独立时，第一个事件的结果不会影响第二个事件的概率。一个经典例子是连续抛两次均匀硬币。无论第一次抛掷结果如何，第二层的每条分支都承载相同的概率（正面为 ½，反面为 ½）。

Consider a spinner with red (R) probability 0.4 and blue (B) probability 0.6, spun twice. The tree diagram has four paths: RR, RB, BR, BB. Each path probability is the product of the individual branch probabilities.

考虑一个指针转盘，红色 (R) 概率为 0.4，蓝色 (B) 概率为 0.6，旋转两次。树状图有四条路径：RR、RB、BR、BB。每条路径的概率是各分支概率的乘积。

• P(RR) = 0.4 × 0.4 = 0.16
• P(RB) = 0.4 × 0.6 = 0.24
• P(BR) = 0.6 × 0.4 = 0.24
• P(BB) = 0.6 × 0.6 = 0.36

These four path probabilities sum to 0.16 + 0.24 + 0.24 + 0.36 = 1.00, confirming the diagram is correctly constructed. To find P(exactly one red), we add the paths RB and BR: 0.24 + 0.24 = 0.48.

这四条路径概率之和为 0.16 + 0.24 + 0.24 + 0.36 = 1.00，验证了树状图的正确性。要计算 P(恰好一次红色)，我们将路径 RB 和 BR 相加：0.24 + 0.24 = 0.48。

---

4. The “At Least One” Technique | “至少一次”技巧

Questions asking for P(at least one success) appear frequently in IGCSE papers. The complementary approach transforms these problems into simpler calculations: P(at least one) = 1 − P(none). This often requires just one path on the tree diagram instead of many.

问及 P(至少一次成功) 的题目在 IGCSE 试卷中非常常见。补集方法将这些题目转化为更简单的计算：P(至少一次) = 1 − P(一次都没有)。这种方法在树状图上通常只需计算一条路径而非多条。

Example: A biased coin has P(Heads) = 0.7 and P(Tails) = 0.3. The coin is tossed three times. Find the probability of getting at least one head.

示例：一枚不均匀硬币，P(正面) = 0.7，P(反面) = 0.3。硬币抛掷三次。求至少出现一次正面的概率。

The only path with no heads is TTT. Its probability is 0.3 × 0.3 × 0.3 = 0.027. Therefore, P(at least one head) = 1 − 0.027 = 0.973.

没有正面出现的唯一路径是 TTT。其概率为 0.3 × 0.3 × 0.3 = 0.027。因此，P(至少一次正面) = 1 − 0.027 = 0.973。

This technique reduces what would be seven paths (HHT, HTH, THH, HTT, THT, TTH, HHH) to a single calculation. Always check whether the complement is easier to compute before adding multiple path probabilities.

该技巧将原本需要计算七条路径（HHT、HTH、THH、HTT、THT、TTH、HHH）的问题简化为单一计算。在累加多条路径概率之前，务必先判断补集是否更容易计算。

---

5. Dependent Events: Sampling Without Replacement | 相关事件：不放回抽样

Without-replacement problems are the most common dependent-event scenarios in IGCSE. When an item is removed and not returned, the probabilities for the next draw change. The tree diagram must reflect these changing probabilities at each level.

不放回抽样问题是 IGCSE 中最常见的相关事件场景。当物品被取出且不放回时，下一次抽取的概率会发生变化。树状图必须在每一层反映这些变化的概率。

Example: A bag contains 5 red and 3 blue marbles. Two marbles are drawn without replacement. Find P(both marbles are red) and P(one of each colour).

示例：一个袋子中有 5 颗红色和 3 颗蓝色弹珠。不放回地抽取两颗。求 P(两弹珠均为红色) 和 P(一红一蓝)。

First draw: P(R) = 5/8, P(B) = 3/8. After a red is removed, only 4 red and 3 blue remain: P(R|R) = 4/7, P(B|R) = 3/7. After a blue is removed, 5 red and 2 blue remain: P(R|B) = 5/7, P(B|B) = 2/7.

第一次抽取：P(红) = 5/8，P(蓝) = 3/8。抽出一颗红色后，剩余 4 红 3 蓝：P(红|红) = 4/7，P(蓝|红) = 3/7。抽出一颗蓝色后，剩余 5 红 2 蓝：P(红|蓝) = 5/7，P(蓝|蓝) = 2/7。

P(RR) = 5/8 × 4/7 = 20/56 = 5/14

For one of each colour, we must consider both orders: P(R then B) = 5/8 × 3/7 = 15/56, and P(B then R) = 3/8 × 5/7 = 15/56. Adding these gives 30/56 = 15/28.

对于一红一蓝，必须考虑两种顺序：P(先红后蓝) = 5/8 × 3/7 = 15/56，P(先蓝后红) = 3/8 × 5/7 = 15/56。相加得到 30/56 = 15/28。

Notice that P(RB) = P(BR) in this case—a symmetry that arises because the total number of items is fixed. This symmetry can be used as a quick check for your calculations.

注意到此处 P(红蓝) = P(蓝红)——这种对称性源于物品总数固定。这一对称性可作为计算的快速检验方法。

---

6. Conditional Probability from Tree Diagrams | 从树状图提取条件概率

Tree diagrams naturally organise conditional probabilities: the probability on a second-level branch is already a conditional probability. For example, the notation P(R|R) on the second branch literally means “probability of red given that the first marble was red.”

树状图天然地组织了条件概率：第二层分支上的概率本身就是条件概率。例如，第二层分支上的记号 P(红|红) 字面意思是”在第一次取到红色的条件下，第二次取到红色的概率”。

To find P(A|B) from a tree diagram, use the formula P(A|B) = P(A ∩ B) / P(B). The numerator is the probability of the path containing both A and B, and the denominator is the sum of all path probabilities that include B.

要从树状图求 P(A|B)，使用公式 P(A|B) = P(A ∩ B) / P(B)。分子是同时包含 A 和 B 的路径概率，分母是所有包含 B 的路径概率之和。

Example: In the marble problem from Section 5, find P(second marble is red | first marble was blue). From the diagram, this is directly the branch probability after blue: P(R|B) = 5/7.

示例：在第 5 节的弹珠问题中，求 P(第二颗为红色 | 第一颗为蓝色)。从树状图直接看出，这是蓝色之后的分支概率：P(红|蓝) = 5/7。

For a reversed conditional probability, such as P(first was blue | second is red), we must apply the full formula: the numerator is P(B then R) = 15/56, and the denominator is P(R on second draw) = P(RR) + P(BR) = 20/56 + 15/56 = 35/56. Thus P(B|R) = 15/35 = 3/7.

对于反向条件概率，如 P(第一次为蓝色 | 第二次为红色)，则须应用完整公式：分子为 P(先蓝后红) = 15/56，分母为 P(第二次为红色) = P(红红) + P(蓝红) = 20/56 + 15/56 = 35/56。因此 P(蓝|红) = 15/35 = 3/7。

---

7. Three-Stage Tree Diagrams | 三阶段树状图

Edexcel IGCSE frequently extends tree diagrams to three stages. While these diagrams have 2³ = 8 paths, the same principles apply: multiply along branches and add across paths for “or” situations. Careful organisation is essential to avoid missing paths.

Edexcel IGCSE 经常将树状图扩展到三个阶段。虽然这种图有 2³ = 8 条路径，但同样的原则适用：沿分支相乘，对”或”的情形跨路径相加。仔细的组织至关重要，以免遗漏路径。

Example: A factory produces items where each item independently has a probability of 0.1 of being defective. Three items are sampled. Find P(exactly two defectives).

示例：某工厂生产的产品，每件产品有 0.1 的概率独立地存在缺陷。抽取三件样品。求 P(恰好两件有缺陷)。

Let D denote defective and G denote good. P(D) = 0.1, P(G) = 0.9. The paths with exactly two D’s are DDG, DGD, and GDD. Each has probability 0.1 × 0.1 × 0.9 = 0.009.

设 D 表示有缺陷，G 表示无缺陷。P(D) = 0.1，P(G) = 0.9。恰好两个 D 的路径为 DDG、DGD 和 GDD。每条的概率均为 0.1 × 0.1 × 0.9 = 0.009。

P(exactly 2 D) = 3 × 0.009 = 0.027

The multiplication by 3 arises because the defective item can be in any of three positions. Recognising this combinatorial pattern saves you from drawing an unnecessarily large diagram, though drawing it fully is always acceptable.

乘以 3 是因为有缺陷的产品可以出现在三个位置中的任何一个。识别这种组合模式可以避免画出不必要的庞大图形，尽管完整画出始终是可接受的。

---

8. Tricky Scenarios: Conditional Branch Probabilities | 棘手情形：条件分支概率

Some questions present probabilities that depend on the outcome of a previous event in non-obvious ways. A common type involves a game where a correct answer lets you advance. The branch probabilities shift depending on whether you are in a “boosted” state or not.

有些题目给出的概率以不明显的方式依赖于先前事件的结果。常见类型是答题游戏中，答对后可晋升。分支概率会根据你是否处于”加成”状态而改变。

Example: In a quiz, P(correct on first question) = 0.6. If the first answer is correct, the contestant gains confidence, and P(correct on second) = 0.8. If the first answer is wrong, P(correct on second) = 0.3. Find P(second answer is correct).

示例：在一次测验中，P(第一题答对) = 0.6。如果第一题答对，选手获得信心，P(第二题答对) = 0.8。如果第一题答错，P(第二题答对) = 0.3。求 P(第二题答对)。

The tree has first-level branches 0.6 (C) and 0.4 (W). From C: second branches 0.8 (C) and 0.2 (W). From W: second branches 0.3 (C) and 0.7 (W).

树的第一层分支为 0.6（对）和 0.4（错）。从”对”出发：第二层分支 0.8（对）和 0.2（错）。从”错”出发：第二层分支 0.3（对）和 0.7（错）。

P(second correct) = P(C then C) + P(W then C) = (0.6 × 0.8) + (0.4 × 0.3) = 0.48 + 0.12 = 0.60.

P(第二题答对) = P(对对) + P(错对) = (0.6 × 0.8) + (0.4 × 0.3) = 0.48 + 0.12 = 0.60。

This is an application of the Law of Total Probability, understood intuitively through tree diagrams: to find the probability of an outcome, sum over all paths leading to that outcome.

这是全概率法则的一个应用，通过树状图可以直观理解：要求某结果的概率，汇总所有通向该结果的路径即可。

---

9. Using Tree Diagrams to Verify Independence | 用树状图验证独立性

A subtle but important use of tree diagrams is testing whether two events are independent. Recall that events A and B are independent if and only if P(A|B) = P(A), or equivalently P(A ∩ B) = P(A) × P(B).

树状图的一个微妙但重要的用途是检验两个事件是否独立。回顾一下：事件 A 和 B 独立当且仅当 P(A|B) = P(A)，或等价地 P(A ∩ B) = P(A) × P(B)。

If a tree diagram is drawn assuming independence, the second-level branch probabilities must equal the first-level probabilities for the corresponding events. In a without-replacement scenario, the second-level branches differ, confirming dependence.

如果树状图是假设独立的情况下绘制的，那么第二层分支概率必须等于第一层对应事件的概率。在不放回抽样场景中，第二层分支概率不同，从而确认了相关性。

Conversely, if examination of a tree diagram reveals that P(A|B) ≠ P(A), the events are dependent, and any calculation assuming independence would be invalid. This serves as a powerful diagnostic tool in multi-stage experiments.

反之，如果检查树状图发现 P(A|B) ≠ P(A)，则事件是相关的，任何假设独立的计算都将无效。这为多阶段实验提供了一个强大的诊断工具。

---

10. Common Pitfalls and Exam Strategies | 常见误区与应试策略

Pitfall 1: Forgetting to multiply every branch along the path. Each path probability is a product of ALL branch probabilities, not just the first and last. Pitfall 2: Adding probabilities from paths that should be multiplied together, or vice versa.

误区一：忘记将路径上的每条分支概率相乘。每条路径的概率是路径上所有分支概率的乘积，而不仅仅是第一个和最后一个。误区二：在应该相乘时却将不同路径的概率相加，或反之。

Pitfall 3: Using identical second-level probabilities for without-replacement problems. Always adjust the denominator and numerator after each removal. Pitfall 4: Interpreting “at least one” as exactly one; use the complement 1 − P(none) instead.

误区三：在不放回问题中使用相同的第二层概率。每次取出后都必须调整分子和分母。误区四：将”至少一次”误解为”恰好一次”；应使用补集 1 − P(一次都没有)。

Strategy | 策略	Why It Works | 为何有效
Write all branch probabilities as decimals or fractions consistently | 始终保持小数或分数一致	Simplifies arithmetic and reduces confusion | 简化运算，减少混淆
Check that each node’s branches sum to 1 | 检查每个节点分支之和为 1	Catches errors immediately | 立即发现错误
List all paths before calculating | 计算前列出所有路径	Prevents omission of valid outcomes | 防止遗漏有效结果
Use complement for “at least” questions | 对”至少”类问题使用补集	Fewer paths to compute | 需要计算的路径更少

Examiners award method marks for clearly shown branch probabilities and path products. Even if your final answer is incorrect, a well-labelled tree diagram can earn significant partial credit.

考官会对清晰展示的分支概率和路径乘积给予方法分。即使最终答案有误，标注清晰的树状图仍可获得可观的部分分数。

---

11. Worked Example: Full Examination Question | 例题精解：完整考试题

An IGCSE question presents a game with two boxes. Box 1 contains 3 red and 2 blue balls. Box 2 contains 4 red and 6 blue balls. A ball is drawn at random from Box 1; if it is red, a second ball is drawn from Box 1 (without replacement); if it is blue, a second ball is drawn from Box 2. Find P(second ball is red).

一道 IGCSE 题目给出一个双盒游戏。盒 1 中有 3 红 2 蓝。盒 2 中有 4 红 6 蓝。从盒 1 随机取一颗；若为红色，则第二颗从盒 1 抽取（不放回）；若为蓝色，则第二颗从盒 2 抽取。求 P(第二颗为红色)。

First level: P(R₁) = 3/5, P(B₁) = 2/5. From R₁: P(R₂|R₁) = 2/4 = 1/2, P(B₂|R₁) = 2/4 = 1/2. From B₁: P(R₂|B₁) = 4/10 = 2/5, P(B₂|B₁) = 6/10 = 3/5.

第一层：P(红₁) = 3/5，P(蓝₁) = 2/5。从红₁ 出发：P(红₂|红₁) = 2/4 = 1/2，P(蓝₂|红₁) = 2/4 = 1/2。从蓝₁ 出发：P(红₂|蓝₁) = 4/10 = 2/5，P(蓝₂|蓝₁) = 6/10 = 3/5。

P(R₂) = (3/5 × 1/2) + (2/5 × 2/5) = 3/10 + 4/25 = 15/50 + 8/50 = 23/50

Also find P(first was red | second is red). The numerator is P(R₁ and R₂) = 3/5 × 1/2 = 3/10. The denominator is P(R₂) = 23/50. Therefore P(R₁|R₂) = (3/10) ÷ (23/50) = (3/10) × (50/23) = 15/23.

再求 P(第一次为红色 | 第二次为红色)。分子为 P(红₁ 且 红₂) = 3/5 × 1/2 = 3/10。分母为 P(红₂) = 23/50。因此 P(红₁|红₂) = (3/10) ÷ (23/50) = (3/10) × (50/23) = 15/23。

This example demonstrates how advanced tree diagrams combine conditional branching, dependent events, and conditional probability in a single cohesive problem—exactly the calibre expected at the top of the IGCSE grading scale.

此例展示了高级树状图如何将条件分支、相关事件和条件概率整合于一个统一的问题中——这正是 IGCSE 高分档所要求的水平。

---

12. Summary and Final Tips | 总结与最终建议

Tree diagrams are not merely a drawing exercise; they are a systematic method for tracking all outcomes of a multi-stage experiment. Mastery of the four core operations—multiplying along branches, adding across paths, computing complements, and adjusting conditional probabilities—covers the majority of IGCSE probability questions.

树状图不仅仅是画图练习；它是追踪多阶段实验所有结果的系统方法。掌握四大核心运算——沿分支相乘、跨路径相加、计算补集、调整条件概率——就能覆盖 IGCSE 概率题的大部分内容。

Approach every tree diagram question with a consistent routine: identify whether events are independent or dependent, determine how many stages the tree needs, write every branch probability explicitly, verify that node sums equal 1, and finally circle the relevant paths before performing calculations.

以固定的套路应对每道树状图题目：判断事件是独立还是相关；确定树状图需要多少层；明确写出每条分支的概率；验证每个节点之和等于 1；最后在进行计算前圈出相关路径。

With deliberate practice on past papers and careful attention to these structural principles, tree diagrams will transform from a challenging topic into a reliable source of marks. Consistency, clear labelling, and systematic verification are the hallmarks of top-scoring IGCSE candidates.

通过精练历年真题并对上述结构原则给予细致关注，树状图将从一个困难的专题转化为稳定的得分来源。一致性、清晰的标注和系统性的验证是 IGCSE 高分考生的标志性特质。

Published by TutorHao | Mathematics Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）