On this concept: Formula

Not sure which lesson to do first? Find your level and get a plan →

Statistics · Grade 6-8

Tree Diagram

A tree diagram is a branching diagram that shows all possible outcomes of a multi-step random process.

P(path)=∏branch probabilities on that path

Quick Answer

A tree diagram is a branching diagram that shows all possible outcomes of a multi-step random process. Each stage branches into its possible results, each branch can carry its probability, and following one path from start to end gives one combined outcome. Use it for processes that happen in steps: two draws from a bag, a game played twice, a coin and then a die. Multiply along a path to get that path's probability, and add the paths that make your event happen.

Why This Matters

A tree turns a confusing question such as "what is the chance of exactly one win in two games?" into paths you can see and count. It handles what a simple grid cannot: three or more stages, unequal chances, and draws where the second stage depends on the first. Without one, it is easy to count win-then-loss and forget loss-then-win.

Intuitive Explanation

A bag holds 3 red marbles and 2 blue ones. You draw one, keep it out, then draw another. Start with two branches: red with probability 3/5 and blue with 2/5. On the red branch the bag now holds 2 red and 2 blue, so it splits into red 2/4 and blue 2/4. On the blue branch the bag holds 3 red and 1 blue, so it splits into red 3/4 and blue 1/4. That gives four paths and four outcomes: RR, RB, BR, BB.

Multiply along a path: P(RR) = 3/5 × 2/4 = 6/20. The others are RB = 6/20, BR = 6/20 and BB = 2/20, and the four add to 20/20 = 1, a quick check that no path is missing. When several paths make an event happen, add them: "one of each color" is RB or BR, 6/20 + 6/20 = 12/20 = 3/5.

A tree is for outcomes that come in stages. A single action, like one spin of a spinner, needs no tree: just list its outcomes. And when every stage splits into equally likely results that do not depend on earlier stages, as with two dice, a grid gives the same answer faster. The tree earns its place when branch probabilities differ, or when one stage changes the next, as when a marble is kept out.

Think of it like this. A tree diagram works like a map of hiking trails that fork: each fork is a stage, and each complete route from the trailhead to an end point is one outcome. The share of hikers taking a route is the product of the shares choosing each fork along it. Unlike real trails, routes on a tree never rejoin.

Core idea. A multi-step chance process becomes a set of paths: branch at each stage, label each branch with its probability given the path so far, multiply along each path, and add the paths that make up your event.


When to Use

Draw a tree when a chance process happens in stages (first draw, second draw; game 1, game 2), especially when the second stage depends on the first, as with drawing without replacement. Trees also make 'exactly one' and 'at least one' questions visible. For a single step, a simple list is enough. For two independent steps with equally likely results, like two dice, a grid is quicker. When the data come as counts of people in two categories, use a two-way table.

Tip. Ask: Does the chance process happen in steps, with every result of one step leading on to the possible results of the next?

How to Recognize It

Before drawing branches, check that the situation really unfolds in stages and note whether earlier stages change the later chances.

  1. Does the experiment have two or more stages that happen one after another, like a draw and then a second draw?

    Yes is the reason to use a tree. A single draw or spin needs only a list of outcomes, the Sample Space, and one fraction.

  2. Do the chances at a later stage depend on what happened earlier, as when a marble is not put back?

    If yes, give each later branch its own updated fraction: with 3 red in a bag of 10, red after red is 29. If no, every set of branches repeats the same fractions, and the stages are Independent Events.

  3. Is the event you want one path through the tree or several paths?

    One path means multiply along it. Several paths, such as one red and one blue in either order, means multiplying along each and adding the results, which is how the chance of Compound Events is built.

  4. Are you given counts for two features of one group, like grade and sport, rather than stages in time?

    Then Two-Way Tables fit better, since the counts sit in a grid with row and column totals rather than on branches.

Tree Diagram vs Sample Space vs Two-Way Tables vs Compound Events

Trees, lists, tables and 'and/or' events all organize outcomes, so students pick between them at random. Ask whether the situation happens in stages over time, is a plain list, is one group sorted two ways, or is a combination of events.

Tree Diagram

Meaning
A tree diagram draws a multi-step chance process as branches, and each complete path from start to end is one outcome.
Key test
Fits steps in order; branch fractions can change from one stage to the next.
Formula
P(path)=p1×p2
Example
Flipping a coin and then spinning a 4-color spinner gives 2 first branches and 8 branch tips.

Sample Space

Meaning
The sample space is the plain list of all possible outcomes, with no picture of how they come about.
Key test
Just the list; a tree is one way of producing it.
Example
Choosing a day of the week at random has a sample space of 7 outcomes, Monday through Sunday.

Two-Way Tables

Meaning
A two-way table sorts one group of people or things by two features at once and shows the counts in a grid.
Key test
Features happen together, not in steps; you read counts from cells and totals.
Example
A club table shows that 25 of its 80 members are adults who prefer chess to checkers.

Compound Events

Meaning
A compound event joins two or more simple events with 'and' or 'or', whatever tool you use to find its chance.
Key test
Names the kind of event; a tree is one tool for finding its probability.
Formula
P(A∩B)=P(A)⋅P(B) if independent
Example
Rolling an even number and then flipping tails has chance 12×12=14.

Formula & Notation

P(path)=∏branch probabilities on that path
A tree diagram represents a sequential sample space. The probability of a terminal outcome is the product of the conditional branch probabilities along its path.

How to read it: Each full path from start to finish represents one combined outcome.

Worked Examples

Example 1 — Two games, unequal chances

Easy

A soccer team wins 60% of its games. It plays two games, and the result of one does not affect the other. Use a tree diagram to find P(win both) and P(exactly one win).
Show the steps and the answer
  1. Draw game 1 with two branches: W (0.6) and L (0.4).

    The branches leaving any point must add to 1: 0.6+0.4=1.

  2. From each game-1 branch, draw game 2: W (0.6) and L (0.4) again.

    The games do not affect each other, so the second-stage probabilities are the same on both sides.

  3. Multiply along each path: WW =0.6×0.6=0.36, WL =0.6×0.4=0.24, LW =0.4×0.6=0.24, LL =0.4×0.4=0.16.

    The team wins game 1 in 60% of cases, and in 60% of those it also wins game 2: 60% of 60% is 36%.

  4. Check: 0.36+0.24+0.24+0.16=1.

    The four paths are every possible outcome, so their probabilities must add to 1.

  5. Exactly one win is WL or LW: 0.24+0.24=0.48.

    Two different paths give exactly one win, so their probabilities add.

Answer: P(win both) = 0.36; P(exactly one win) = 0.48.

Takeaway: Multiply along a path for 'this, then that'; add the separate paths that give the same event.

Example 2 — Second-stage branches that change

Standard

A drawer holds 4 black socks and 2 white socks. In the dark you pull out two socks, one after the other, without putting the first back. Find the probability that the two socks match.
Show the steps and the answer
  1. First stage: black 46, white 26.

    All 6 socks are equally likely to be pulled first.

  2. Second stage after black: 3 black and 2 white remain, so black 35, white 25. After white: 4 black and 1 white remain, so black 45, white 15.

    The first sock stays out, so the drawer has 5 socks and its mix depends on the first pull.

  3. Multiply along the paths: BB =46×35=1230, BW =830, WB =830, WW =26×15=230; the total is 3030.

    Each path's probability is its first branch times its second branch.

  4. Add the matching paths: 1230+230=1430=715≈0.47.

    "Match" means BB or WW, two separate paths.

  5. Compare with putting the first sock back: 46×46+26×26=2036≈0.56.

    With replacement the second-stage branches would not change, and the answer would be noticeably higher.

Answer: P(match)=715≈0.47 (it would be 59≈0.56 if the first sock were put back).

Takeaway: Write each second-stage branch for the situation after the first stage; without replacement, the branches change.

Example 3 — Find the mistake: adding along a path

Application

A spinner lands on blue with probability 13, and it is spun twice. Noah writes: "P(blue, then blue) = 1/3 + 1/3 = 2/3." Find the mistake and correct it.
Show the steps and the answer
  1. Test Noah's answer: blue twice cannot be more likely than blue on the first spin alone, which is only 13.

    Blue-then-blue requires blue on the first spin and something more, so its chance must be smaller.

  2. Draw the path: first branch blue 13, then second branch blue 13.

    The spins do not affect each other, so the second branch has the same probability.

  3. Multiply along the path: 13×13=19.

    Blue comes up on a third of first spins, and on a third of those the second spin is blue too.

  4. Show where adding belongs: exactly one blue is blue-other or other-blue, 13×23+23×13=49.

    Adding combines different paths; it never combines the branches of one path.

Answer: P(blue, then blue)=19, not 23.

Takeaway: Along one path, multiply. Add only when an event is made of several different paths.

Where You'll See It

  • Pizza order choices

    Branch first by crust, then by topping; each complete path from root to tip is one possible pizza, so the tree lists every combination without missing any.

  • Two-game tournament

    Branch by win/lose in game 1, then game 2. Multiplying the probabilities along a path gives the chance of, say, winning both games.

  • Drawing two marbles

    First-draw branches lead to second-draw branches; multiplying along a red-then-blue path gives that sequence's probability and shows how the second draw depends on the first.

Common Mistakes

  1. The slip: Add the branch probabilities along a path.

    Why it's tempting: Adding is the go-to move for combining numbers.

    Instead: For the probability of a full path, MULTIPLY the branch probabilities; you add only across different paths that satisfy the event.

  2. The slip: You can stop drawing branches once you 'see the pattern'.

    Why it's tempting: Trees get big and finishing them feels redundant.

    Instead: Every branch must be drawn out; skipping branches drops valid outcomes and makes the sample space incomplete.

  3. The slip: Branch probabilities stay the same at every stage.

    Why it's tempting: It's tidy to reuse the same fractions.

    Instead: When draws are without replacement, later-stage branch probabilities change because the pool shrinks (e.g. 3/10 then 2/9).


Mini Practice

Try these on your own. Tap Reveal when you want to check.

  1. Draw a tree diagram for choosing a sandwich (ham or cheese) and then a drink (milk, juice or water). How many complete paths are there?

    Hint: Each sandwich branch splits into one branch for every drink.

  2. A coin is flipped, then a spinner with 4 equal sections numbered 1 to 4 is spun. Use a tree diagram to find P(heads and 3).

    Hint: Follow one path and combine the branch probabilities along it.

  3. The chance of rain on Saturday is 0.3. If it rains, the game is cancelled with probability 0.8. If it does not rain, the game is cancelled with probability 0.1. Find P(game cancelled).

    Hint: Two different paths end in "cancelled". Find each one, then combine them.

  4. A bag has 3 red and 2 blue marbles. Two marbles are drawn without replacement. Use a tree diagram to find P(both red).

    Hint: After the first red is taken, how many marbles and how many reds are left?

  5. You roll one number cube and want P(even). Do you need a tree diagram, or is a basic probability count enough?

    Hint: How many stages does this random process have?

  6. The bus is late with probability 0.2 each day, independently. Nico finds P(late Monday and late Tuesday) as "0.2+0.2=0.4". Correct his work.

    Hint: Should "late both days" be more likely or less likely than "late on Monday"?

Want the full set?

50 practice questions for this concept — free to try, every one with a complete worked solution showing the why, not just the answer.

Frequently Asked Questions

Do the probabilities on the branches leaving one point always add up to 1?

Yes, and that makes a quick check. The branches leaving any point cover everything that can happen next, so their probabilities must total 1, such as 410+610\frac{4}{10} + \frac{6}{10} for red or green. The probabilities of all the branch tips also add to 1. If a set of branches adds to 910\frac{9}{10}, a branch or an outcome is missing.

Does it matter which stage I draw first?

For things that happen in order, like two draws, draw them in that order so the second-stage fractions make sense. For two independent things happening together, like a coin and a die, either order works and gives the same final probabilities, only arranged differently. Putting the stage with fewer results first keeps the tree narrower and easier to read.

Can a tree diagram show choices that are not random, like picking an outfit?

Yes. A tree lists the options for any step-by-step decision, such as a shirt and then shoes, and counts the combinations at the tips. Probabilities go on the branches only when the choices are made at random. If you pick your outfit on purpose, the tree still counts 6 possible outfits but says nothing about which one you are likely to wear.

Why might the tips of a tree have different probabilities when each is one outcome?

Each tip's chance is the product of its branches, and those can differ. With a spinner that lands on red 3 times out of 4, the path red then red has probability 34×34=916\frac{3}{4} \times \frac{3}{4} = \frac{9}{16}, while blue then blue has only 116\frac{1}{16}. Counting tips and dividing by the number of tips works only when every branch has the same chance.

Learning Path

You need Sample Space (listing every outcome once) and Basic Probability (fractions from 0 to 1) first. Tree diagrams add stages, branch probabilities, multiplying along paths and adding across paths. Next, Compound Events names the 'and' and 'or' events that trees reveal, Conditional Probability is the probability written on a second-stage branch, and the Multiplication Rule writes the multiply-along-a-path step as a formula.

See Also