Skip to main content
Mathematics LibreTexts

6.4: Tree Diagrams and Multistage Probability

  • Page ID
    237527
  • \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    \( \newcommand{\dsum}{\displaystyle\sum\limits} \)

    \( \newcommand{\dint}{\displaystyle\int\limits} \)

    \( \newcommand{\dlim}{\displaystyle\lim\limits} \)

    \( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)

    ( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\id}{\mathrm{id}}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\kernel}{\mathrm{null}\,}\)

    \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\)

    \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\)

    \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)

    \( \newcommand{\vectorA}[1]{\vec{#1}}      % arrow\)

    \( \newcommand{\vectorAt}[1]{\vec{\text{#1}}}      % arrow\)

    \( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vectorC}[1]{\textbf{#1}} \)

    \( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)

    \( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)

    \( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)

    \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \(\newcommand{\longvect}{\overrightarrow}\)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    \(\newcommand{\ket}[1]{\left| #1 \right>}\)
    \(\newcommand{\bra}[1]{\left< #1 \right|}\)
    \(\newcommand{\braket}[2]{\left< #1 \vphantom{#2} \right| \left. #2 \vphantom{#1} \right>}\)
    \(\newcommand{\braopket}[3]{\left< #1 \vphantom{#2}\vphantom{#3} \right| #2 \vphantom{#1}\vphantom{#3} \left| #3 \vphantom{#1}\vphantom{#2} \right>}\)
    \(\newcommand{\qmvec}[1]{\mathbf{\vec{#1}}}\)
    \(\newcommand{\op}[1]{\hat{\mathbf{#1}}}\)
    \(\newcommand{\expect}[1]{\langle #1 \rangle}\)
    \(\newcommand{\dfn}[1]{\emph{\textbf{#1}}}\)

    \(\newcommand{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left|#1\right|}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)
    Learning Objectives
    • Represent multistage probability scenarios with tree diagrams.
    • Solve conditional probability problems using tree diagrams.
    • Solve reverse conditional probability problems using an intuitive Bayes’ Theorem approach.

    Introduction

    In many probability settings, especially those involving multiple stages, it becomes helpful to visualize how outcomes unfold step by step. A probability tree diagram provides this structure by displaying each stage as a branching path, with every branch labeled by its corresponding probability. Tree diagrams make complex, multistage experiments easier to interpret, compare, and calculate. As you move from left to right along the tree, you can trace complete outcome sequences and compute their probabilities by multiplying along the branches.

    In this section, you will explore probabilities of more complex events by using tree diagrams as a tool for problem solving

    Drawing a Probability Tree

    In multistage probability experiments, listing every possible outcome in a sample space can quickly become inefficient -- especially when the outcome of one stage determines what happens in the next. A probability tree diagram provides a clear and systematic way to represent all possible outcomes and their associated probabilities. By displaying each stage as a branching structure, a tree diagram allows us to trace complete paths through the experiment and compute their probabilities using the Multiplicative Rule of Probability.

    Consider the following two‑stage game of chance: First, a coin is flipped. Then, depending on the coin’s result, a chip is drawn from one of two urns.

    • If the coin lands heads, a chip is drawn from Urn A, which contains 8 yellow chips and 5 green chips.
    • If the coin lands tails, a chip is drawn from Urn B, which contains 6 yellow chips and 6 green chips.

    Because the chip selection depends on the coin toss, there are several possible ways to obtain a yellow or green chip. Rather than listing all outcomes, we construct a probability tree diagram to organize the information using the steps below.

    1. Identify the stages. In this game the first stage is the coin toss and the second stage is the chip selection from the appropriate urn.
    2. Draw a set of branches for the first stage. From a starting point, draw two branches representing the coin outcomes - one for heads and one for tails. Label each branch with its probability:
    • \(P(H) = \frac{1}{2}\)
    • \(P(T) = \frac{1}{2}\)
    1. Draw sets of branches for the second stage. You will need two sets of branches, one for drawing a chip if the coin was Heads and one for drawing a chip if the coin was Tails.
    • From the Heads branch, draw branches for drawing a chip from Urn A and label each with its probability.
      • \(P(Y)=\frac{8}{13}\)
      • \(P(G)=\frac{5}{13}\)
    • From the Tails branch, draw branches for drawing a chip from Urn B and label each with its probability.
      • \(P(Y)=\frac{6}{12}\)
      • \(P(G)=\frac{6}{12}\)

    So far, the tree diagram should look like this:

    An image of a tree diagram as described in Steps 1, 2, and 3.

    1. Compute the probability of each complete outcome. Apply the Multiplicative Rule of Probability by multiplying across each path.
    • Heads → Yellow from Urn A: \(\frac{1}{2} \cdot \frac{8}{13} = \frac{8}{26} = \frac{4}{13}\)
    • Heads → Green from Urn A: \(\frac{1}{2} \cdot \frac{5}{13} = \frac{5}{26}\)
    • Tails → Yellow from Urn B: \(\frac{1}{2} \cdot \frac{6}{12} = \frac{6}{24} = \frac{1}{4}\)
    • Tails → Green from Urn B: \(\frac{1}{2} \cdot \frac{6}{12} = \frac{6}{24} = \frac{1}{4}\)

    The completed probability tree is shown below:

    A completed tree diagram labeled as described in Step 4

    1. Check that the probabilities of all endpoints sum to 1. The endpoints of the tree represent the entire sample space. Their probabilities must add to 1, confirming that the diagram is complete and accurate.

    \(\dfrac{4}{13}+\dfrac{5}{26}+\dfrac{1}{4}+\dfrac{1}{4}=1\)

    The tree diagram is now ready to be used to answer questions about various probabilities as shown in Example 6.4.1.

    Using a Probability Tree to Solve Problems

    Example \(\PageIndex{1}\)

    In the game of chance described previously, you win if you end up with a yellow chip.

    What is the probability of getting a yellow chip?

    Solution

    Looking at the diagram, there are two ways to select a yellow chip:

    1. Get Heads on the coin and yellow from Urn A:

    \(P(\text{Heads} \cap \text{Yellow})=\frac{4}{13}\)

    2. Get Tails on the coin and yellow from Urn B:

    \(P(\text{Tails} \cap \text{Yellow})= \frac{1}{4}\)

    Add the probabilities of these “two paths” to getting a yellow chip:

    \(\begin{align*} P(\text{yellow}) &= P(\text{Heads} \cap \text{Yellow})+P(\text{Tails} \cap \text{Yellow}) \\[6pt] &= \frac{4}{13} + \frac{1}{4} \\[6pt] &= \frac{16}{52} + \frac{13}{52} \\[6pt] &= \frac{29}{52} \end{align*}\)

    The probability of getting a yellow chip is \(\frac{29}{52} \approx 0.5577\) or 55.77%.

    Example \(\PageIndex{2}\)

    Sarah either walks (W) or rides the bus (B) to school. Her likelihood of being late (L) or on time (OT) depends on which mode of transportation she chooses. The partial tree diagram displays these stages in sequence.

    Tree diagram showing P(B) = 1/3, P(L|W)=1/10, and P(OT}B)=19/20.

    Use the probabilities given in the tree diagram to complete the tree diagram and find the probability that Sarah is late for school.

    Solution

    First, recall that the events on each set of branches are complementary events. That is, they must add to be 1. This allows you to find the all the missing probabilities in the tree:

    \(P(W) = 1- P(B) = 1-\frac{1}{3} = \frac{2}{3}\)

    \(P(OT | W) = 1- P(L | W) = 1-\frac{1}{10} = \frac{9}{10}\)

    \(P(W | B) = 1- P(OT | B) = 1-\frac{19}{20} = \frac{1}{20}\)

    A completed tree diagram showing P(W)=2/3, P(OT|W)=9/10 , and P(L|B)=1/20.

    Now the diagram is complete, each full path represents one possible outcome of Sarah’s trip to school, and the probability of that outcome is found by multiplying the probabilities along its branches. To determine the probability that Sarah is late, we identify the two distinct paths in the tree that end in L:

    1. Walk and Late: \(P(W \cap L) = \frac{2}{3} \cdot \frac{1}{10} = \frac{2}{30}\)
    2. Bus and be Late: \(P(B \cap L) = \frac{1}{3} \cdot \frac{1}{20} = \frac{1}{60}\)

    \(\begin{align*} P(L) &= P(W \cap L) + P(B \cap L) \\[6pt] &= \frac{2}{30} + \frac{1}{60} \\[6pt] &= \frac{4}{60} + \frac{1}{60} \\[6pt] &= \frac{5}{60} \\[6pt] &= \frac{1}{12} \end{align*}\)

    The probability that Sarah is late is \(\frac{1}{12} \approx 0.0833\) or 8.33%.

    Example \(\PageIndex{3}\)

    An assembler of computer routers and modems purchases its parts from two suppliers.

    • Company A provides 60% of the parts.
    • Company B provides the remaining 40%.

    Quality records show that 3% of Company A’s parts are defective, while 8% of Company B’s parts are defective. If one part is selected at random, determine the probability that it is defective.

    Solution

    To organize this two‑stage situation, we use a probability tree diagram. The first set of branches represents the suppliers \((A)\) or \((B)\). These probabilities are \(P(A)=0.60\) and \(P(B)=0.40\).

    The second set of branches represents whether the selected part is defective ((D\) or not defective \(D^{\prime}\). Notice, however, that these probabilities change depending on which company made the part.

    • If Company A makes the part, \(P(D | A) = 0.03\) and \(P(D^{\prime} | A) = 1-0.03 = 0.97\).
    • If Company B makes the part, \(P(D | B) =0.08\) and \(P(D^{\prime} |B) = 1-0.08=0.92\).

    We can determine the probabilities of the multistage events by applying the Multiplicative Rule of Probability and multiplying through the branches:

    A completed tree diagram with final probabilities shown

    In the completed tree diagram, verify the sum of the probabilities of all outcomes add to be 1:

    \(0.018+0.582+0.032+0.368= 1\)

    To determine the probability an item is defective, we identify the two distinct paths in the true where the item is defective:

    1. A and Defective: \(P(A \cap D) = 0.60 \cdot 0.03 = 0.018\)
    2. B and Defective: \(P(B \cap D) = 0.40 \cdot 0.08 = 0.032\)

    \(\begin{align*} P((\text{item is defective}) &= P(A \cap D) + P(B \cap D) \\[4pt] &= 0.018 + 0.032 \\[4pt] &= 0.05 \end{align*}\)

    The probability that an item is defective 0.05 or 5%.

    You Try It \(\PageIndex{A}\)

    A wildlife researcher is studying two species of birds in a forest where 40% of the birds in the area are sparrows (S) and the remaining 60% are finches (F).

    During observation, the researcher notes that 15% of sparrows and 25% of finches sing during the morning observation period.

    If one bird is spotted at random, what is the probability that it sings during the morning observation period?

    Answer

    0.21 or 21%

    Example \(\PageIndex{4}\)

    A box contains 20 candies, of which 8 contain nuts and 12 do not. Two candies are selected at random without replacement. Determine the probability that exactly one of the two selected candies contains nuts.

    Solution

    We proceed as we did in Example 6.4.1 by first drawing a tree diagram and labeling each branch with the probability of getting a piece of candy with nuts \(N\) and the probability of a piece without nuts \(N^{\prime}\). For the first selection, these probabilities are \(P(N)=\frac{8}{20}\) and \(P(N^{\prime})=\frac{12}{20}\).

    Notice, however, that on the second selection, the probabilities change depending on the first selection.

    • If the first candy has nuts, there are 7 pieces remaining with nuts and 12 pieces remaining without nuts. There are 19 pieces in all. \(P(N_2 | N_1) = \frac{7}{19}\) and \(P(N^{\prime}_2 | N_1) = \frac{12}{19}\).
    • If the first candy doesn't have nuts, there are 8 pieces remaining with nuts and 11 pieces remaining without nuts. There are 19 pieces in all. \(P(N_2 | N^{\prime}_1) = \frac{8}{19}\) and \(P(N^{\prime}_2 | N^{\prime}_1) = \frac{11}{19}\).

    A completed tree diagram labeled as described above.

    We can determine the probabilities of the multistage events by applying the Multiplicative Rule of Probability and multiplying through the branches:

    A completed tree diagram using the procedure described above

    In the completed tree diagram, verify the sum of the probabilities of all outcomes add to be 1:

    \(\dfrac{56}{380}+\dfrac{96}{380}+\dfrac{96}{380}+\dfrac{132}{380}=\dfrac{380}{380} = 1\)

    To determine the probability of getting exactly one piece of candy with nuts, we identify the two distinct paths in the tree:

    1. Nuts and No nuts: \(P(N_1 \cap N^{\prime}_2) = \frac{8}{20} \cdot \frac{12}{19} = \frac{96}{380}\)
    2. No nuts and Nuts: \(P(N^{\prime}_1 \cap N_2) = \frac{12}{20} \cdot \frac{8}{19} = \frac{96}{380}\)

    \(\begin{align*} P((\text{exactly one piece with nuts}) &= P(N_1 \cap N^{\prime}_2) + P(P(N^{\prime}_1 \cap N_2)) \\[6pt] &= \frac{96}{380} + \frac{96}{380} \\[6pt] &= \frac{192}{380} \\[6pt] &= \frac{48}{95} \end{align*}\)

    The probability of getting exactly one piece of candy with nuts is \(\frac{48}{95} \approx 0.5053\) or 50.53%.

    You Try It \(\PageIndex{B}\)

    A jar contains 10 marbles, of which 4 are red and 6 are blue. Two marbles are selected at random without replacement. Determine the probability that exactly one of the two selected marbles is red.

    Answer

    \(\frac{8}{15} \approx 0.5333 \text{or } 53.33\%\)

    Reversing the Condition: An Intuitive Approach to Bayes' Theorem

    So far, we have worked with conditional probability, dependent events, and probability trees. In many of those situations, we knew the chance that one event happened first, and then the chance of a second event happening after it. For example, we might know the probability that a student takes the bus and the chance that a student is late if they take the bus.

    However, many everyday problems work in the reverse direction. We observe a result first and then we want to reason backward to figure out the most likely cause. That is, if we know a student is late, what's the chance they took the bus? This “reverse” conditional probability is extremely common in real life.

    This type of backwards reasoning is exactly what a famous rule in probability, Bayes’ Theorem, is designed to handle. Bayes’ Theorem helps us revise a probability after new information is observed. Instead of asking, “What is the chance of this result given the cause?” we ask, “What is the chance of the cause given the result?”

    To illustrate this idea, recall the scenario from Example 6.4.3. An assembler of computer routers and modems purchases parts from two suppliers. Company A provides 60% of the parts and Company B provides the remaining 40%. It turns out that 3% of Company A’s parts are defective while 8% of Company B’s parts are defective.

    From this information, we can easily answer a “forward” question such as:

    What is the probability a part is defective given it came from Company A? This is simply 3%.

    But now consider the reverse question:

    If the part I just bought is defective, what is the probability it came from Company A? This is no longer 3%.

    This is a very different question—and it is exactly the kind of question Bayes’ Theorem helps us answer.

    Although Bayes’ Theorem has a formal algebraic formula, using that formula directly is beyond the scope of this course. Fortunately, Bayes’ Theorem problems are very accessible when we use probability trees. A tree diagram organizes the information step‑by‑step and allows us to compute reverse conditional probabilities by comparing the correct branches. In other words, we do not need the formula to understand the idea. We only need a clear tree diagram and careful reasoning.

    Let’s take a look at an example.

    Example \(\PageIndex{5}\)

    From Example 6.4.3:

    An assembler of computer routers and modems purchases its parts from two suppliers.

    • Company A provides 60% of the parts.
    • Company B provides the remaining 40%.

    Quality records show that 3% of Company A’s parts are defective, while 8% of Company B’s parts are defective.

    A part was just found to be defective. What's the chance the part was provided by Company A?

    Solution

    We want to find the probability that a defective part came from Company A. This is a reverse conditional probability: instead of asking for the chance a part is defective given it came from \(A\), we ask for the chance it came from \(A\) given that it is defective. That is, we want to calculate \(P(A | D)\). Probability trees make this type of question clear and manageable.

    To compute \(P(A | D)\) we need two quantities:

    • The probability a part came from Company A and is defective: \(P(A \cap D)\)
    • The overall probability that a part is defective: \(P(D)\)

    In the solution of Example 6.4.3 we drew this probability tree:

    A completed tree diagram with final probabilities shown

    From the tree diagram we see that

    • \(P(A \cap D) = 0.60 \cdot 0.03 = 0.018\)
    • \(P(D) = 0.018 + 0.032 = 0.05\)

    Substituting into the reversed conditional formula,

    \begin{align*} P(A \mid D) &= \dfrac{P(A \cap D)}{P(D)} \\[4pt] &= \dfrac{0.018}{0.05} \\[4pt] &= 0.36 \end{align*}

    There is a 36% chance that the defective part was provided by Company A.

    Example \(\PageIndex{6}\)

    A restaurant offers two entrée choices: steak or fish. About 75% of customers order steak, and the remaining 25% order fish. After eating, each customer is asked whether they were satisfied with their meal. A survey shows: 80% of steak‑ordering customers are satisfied and 60% of fish‑ordering customers are satisfied.

    a. Construct a probability tree for this scenario.

    Solution

    Let \(S\) be ordered steak, \(F\) be ordered fish, \(+\) be satisfied, and \(-\) be not satisfied.

    A probability tree showing P(D,+) = 0.6, P(D,-)=0.15, P(F,+)=0.15 and P(F,-)=0.1

    b. Find the probability a customer is satisfied.

    Solution:

    A customer is satisfied in two cases:

    1. They ordered steak and were satisfied: \(P(S,+) = 0.75 \cdot 0.80 = 0.60\)
    2. They ordered fish and were satisfied: \(P(F,+) = 0.25 \cdot 0.60 = 0.15\)

    \(P(+) = P(S,+) + P(F,+) = 0.60 + 0.15 = 0.75\)

    There is a 75% chance a randomly selected customer is satisfied.

    c. Find the probability a customer ordered fish given they were satisfied

    Solution

    Now we restrict the sample space to satisfied customers only: (S,+) and (F,+). This probability was found in part b.

    Use the conditional probability formula:

    \begin{align*} P(S \mid +) &= \dfrac{P(S \cap +)}{P(+)} \\[4pt] &= \dfrac{0.60}{0.75} \\[4pt] &= 0.68\end{align*}

    If a customer was satisfied, there is an 80% chance they ordered steak.

    Example \(\PageIndex{7}\)

    Using the same information and probability tree as in Exercise 6.4.6, find the probability a customer ordered fish given they were dissatisfied.

    Solution

    First restrict the sample space to those customers who are dissatisfied. There are two cases:

    1. They ordered steak and were dissatisfied: \(P(S,-) = 0.75 \cdot 0.20 = 0.15\)
    2. They ordered fish and were dissatisfied: \(P(F,-) = 0.25 \cdot 0.40 = 0.10\)

    \(P(-) = P(S,-) + P(F,-) = 0.15 + 0.10 = 0.25\)

    There is a 25% chance a randomly selected customer is dissatisfied.

    Use the conditional probability formula to find the chance that a dissatisfied customer ordered fish:

    \begin{align*} P(F \mid -) &= \dfrac{P(F \cap -)}{P(-)} \\[4pt] &= \dfrac{0.10}{0.25} \\[4pt] &= 0.40\end{align*}

    If a customer was dissatisfied, there is an 40% chance they ordered fish.

    You Try It \(\PageIndex{C}\)

    A school nurse is checking for a common seasonal allergy among students: 30% of the students at the school have the allergy and rest don't.

    • If a student has the allergy, the chance that they report sneezing during recess is 70%.
    • If a student does not have the allergy, the chance that they report sneezing during recess is 20%.

    A student reports sneezing during recess. Find the probability that this student has the allergy.

    Answer

    0.6 = 60%

    Section Summary

    Probability tree diagrams are a powerful way to organize and solve multistage probability problems. Each branch represents a step in the process, and the probability of any complete outcome is found by multiplying along the branches that form that path. This is an application of the Multiplicative Rule of Probability, which tells us how to compute the probability of “and” events.

    Once the full tree is built, we can answer many different questions by combining the probabilities of the appropriate outcomes in the sample space. Sometimes this means adding several path probabilities together to find the chance of a broader event.

    In some problems, we observe a result first and want to work backward to find the most likely cause. These are called reverse conditional probability problems. To solve them, we restrict the sample space to only the outcomes that match the observed result. Bayes’ Theorem is the formal rule that describes this process, but in this course, we can solve these problems effectively by carefully analyzing a tree diagram and comparing the relevant branches.

    Tree diagrams give us a clear, visual way to understand both forward and reverse conditional probability, making even complex situations easier to reason about.

    Section 6.4 Review Questions

    1. A box contains 3 white and 5 green balls. Two balls are drawn from the box in succession without replacement. Illustrate the process by drawing a condensed tree diagram. Find the probabilities for all the outcomes. Then, use the tree diagram to answer the questions.
      1. Find the probability that both balls are white.
      2. Find the probability that exactly one ball is white.
      3. Find the probability that no balls are white.
      4. Find the probability that both balls are the same color.
      5. Find the probability that the second ball is white.
    1. Jamie and Olivia are best friends and neighbors. As such, they often eat dinner together at one of their houses. About 30% of the time, they eat at Jamie’s house and her mother makes a non-vegetarian meal 65% of the time. The rest of the time, they eat at Olivia’s house and her mother serves a vegetarian meal 55% of the time. Make a tree diagram, including the appropriate probabilities, to illustrate this scenario and then find these probabilities.
      1. What is the probability of going to Olivia’s house and eating a non-vegetarian meal?
      2. What is the probability that the girls will eat a vegetarian dinner?
      3. What is the probability the girls went to Olivia's house if you know they ate a vegetarian dinner?
    1. A community center offers outdoor yoga classes. The probability that the park is crowded on a given day is 0.6. If the park is crowded, the chance that a group of friends decides to attend yoga is 0.2. If the park is not crowded, the chance they attend yoga increases to 0.8. Make a tree diagram, including the appropriate probabilities, to illustrate this scenario and then find these probabilities.
      1. Are the events “park is crowded” and “attend yoga” independent?
      2. What is the probability that the park is crowded and the friends attend yoga?
      3. What is the probability that the park is not crowded and the friends attend yoga?
      4. What is the probability that the friends attend yoga?
      5. The friends attended yoga today. What is the probability that the park was crowded?
    1. It is estimated that 30% of taxpayers “cheat” on their income tax return. Of those who cheat, 60% are audited. Of those who do not cheat, only 20% are audited. Make a tree diagram, listing all final outcomes and the probabilities for those outcomes.
      1. What is the probability that a taxpayer cheats and is also audited?
      2. What is the probability that a taxpayer is audited?
      3. Sue received a letter that she will be audited. What is the probability that Sue cheated on her taxes?
    1. A bag contains 12 marbles -- some are green and the rest are yellow. Brian randomly takes a marble from the bag, records its color, and does not replace it. He then repeats this process a second time. He draws the following tree diagram.

    A probability tree with missing probabilities for A, B, C, and D.

    1. Give the values of the probabilities labeled A, B, C and D for the tree diagram.
    2. Find the probability that Brian gets two marbles with the same color.
    3. Find the probability that Brian gets a yellow marble on the second draw.
    1. Ann and Barbara are playing a tennis match. The first player to win 2 sets wins the match. For any given set the probability that Ann wins the set is \(\frac{2}{3}\). Illustrate the scenario by drawing a tree diagram to find the probabilities for each possible outcome of the match. (There should be 6 outcomes for the sample space of multistage outcomes.)
      1. Find the probability that Ann wins the match.
      2. Find the probability that 3 sets are played before a winner can be determined.
      3. Find the probability that the player who wins the first set goes on to win the match.
    1. Assume that the probability of having skin cancer is 1%. Suppose there is a test for checking the presence of skin cancer. When cancer is present, the test result is positive 90% of the time and negative the other 10%. When cancer is not present, the test is positive 10% of the time, and negative the other 90%.
      1. If someone gets a positive test result, what is the probability they have cancer?
      2. If someone gets a negative test result, what is the probability they do not have cancer?

    This page titled 6.4: Tree Diagrams and Multistage Probability was last modified on Thu, 06 Aug 2026 02:02:28 GMT and is shared under a CC BY-NC-SA license and was authored, remixed, and/or curated by Andy Jones.

    • Was this article helpful?