Tree limit: at most 100 total nodes and at most 12 levels, including the Start root.
| Parent | Outcome | P |
|---|
Use this Probability Tree Calculator to enter values, adjust options, and review results in a compact responsive workspace.
Results are calculated automatically as you enter data.
Tree limit: at most 100 total nodes and at most 12 levels, including the Start root.
| Parent | Outcome | P |
|---|
▼ See explanations and tips below ▼
A probability tree is a branching diagram for a situation that unfolds in steps. Each branch represents a possible outcome at that step, and each branch is labeled with a probability. By following a path from the start of the tree to an ending point, you can model a complete sequence of outcomes.
Probability trees are especially useful when later outcomes depend on earlier outcomes. For example, the chance of traffic may be different on rainy days than on clear days. A tree lets you show that relationship clearly: first branch by weather, then branch again by traffic condition.
The main idea is simple:
Probability problems can become confusing when there are several stages, conditional probabilities, or many possible final outcomes. A tree diagram helps by keeping the structure visible.
Probability trees are useful for:
A tree also helps prevent a common mistake: treating a later probability as if it were unconditional. In a tree, a second-stage branch is usually the probability of an outcome given the path that came before it.
A probability tree starts at a root, then branches into possible outcomes. Under each parent node, the probabilities of the child branches should add to \(1\) when those branches cover all possible next outcomes.
For a parent with child branch probabilities \(p_1, p_2, \ldots, p_m\), a complete branch group should satisfy:
To find the probability of a complete path, multiply the probabilities on the branches in that path:
Where:
For a two-stage event, this is the familiar multiplication rule:
This means the probability of both \(A\) and \(B\) is the probability of \(A\) multiplied by the probability of \(B\) after \(A\) has happened.
If a tree has several terminal paths, the total probability of all leaf outcomes is:
Where \(L\) is the set of leaf paths. In a complete tree, this total should be close to \(1\), or \(100\%\).
Simulation adds another layer. If a path occurs \(n_\ell\) times in \(N\) simulation trials, its empirical probability is:
The theoretical probability comes from the tree. The empirical probability comes from random trials, so it can vary from run to run.
Suppose a test result can be either Pass or Fail:
The branch group is consistent because:
That means the two branches cover all possible outcomes at the start. The probabilities may also be read as \(60\%\) and \(40\%\).
Suppose the first step is weather:
Then traffic depends on the weather:
The probability of the path Rain → Traffic is:
The probability of the path No rain → Traffic is:
To find the total probability of traffic, add the terminal paths that end in traffic:
This shows why trees are helpful: the same final outcome can be reached through more than one path.
Suppose a weather branch group is entered as:
The sum is:
That leaves \(0.1\), or \(10\%\), unaccounted for. The tree may still show the branches, but the model is incomplete until the missing probability is fixed or another branch is added.
A branch probability of \(0\) is allowed in the model. If a path includes a branch with probability \(0\), the full path probability is also \(0\):
A branch probability of \(1\) means that, according to the model, that branch is certain from that parent. If one branch has probability \(1\), the other sibling branches should sum to \(0\) for the group to remain consistent.
The selected path result is the joint probability of following one exact sequence of branches from the start. It is not just the probability of the last outcome label; it includes every branch on the path.
The leaf outcome count tells you how many terminal paths are currently in the tree. This is a count, not a probability.
The leaf probability total shows the sum of all terminal path probabilities. In a complete and consistent tree, this should be close to \(100\%\). If it is much lower or higher, the tree may have missing branches, duplicate coverage, or branch groups that do not add to \(1\).
The consistency status checks whether each set of sibling branches adds to \(100\%\). A consistent tree is important because each parent node should describe a complete set of possible next outcomes.
In simulation results, the theoretical column is based on the branch probabilities. The empirical column is based on random trials. With more trials, empirical results often get closer to theoretical probabilities, but they do not have to match exactly in any single simulation.
Entering percentages instead of decimals. A probability of \(60\%\) should be entered as \(0.6\), not \(60\) and not 60%.
Using fractions when decimals are required. A value such as \(\frac{3}{5}\) should be entered as \(0.6\).
Forgetting that sibling branches should add to \(1\). If branches under the same parent add to \(0.85\) or \(1.20\), the tree does not represent a complete probability split.
Confusing branch probability with path probability. A branch might have probability \(0.8\), but the full path to that branch could have probability \(0.3 \times 0.8 = 0.24\).
Adding when you should multiply. Multiply along one path. Add separate terminal paths only when they represent alternative ways for the event of interest to occur.
Simulating before the tree is consistent. Simulation only makes sense when each branch group is a valid probability split.
Rounding too early. Rounding intermediate probabilities can slightly change final results. Keep decimal inputs as accurate as possible, then round the final interpretation.
Assuming a short graph label changes the real label. Long labels may be shortened in the graph view, but the full label is still the meaningful outcome name in tables and paths.
Use a probability tree when a situation has stages or conditional outcomes, such as:
For a single one-step event, a tree may be unnecessary. For multi-step events, especially when probabilities change after earlier outcomes, a tree can make the structure much easier to understand.
A probability tree is only as reliable as the probabilities entered into it. If the branch probabilities are guesses, outdated, or based on poor data, the result will reflect those weaknesses.
This calculator uses decimal probabilities from \(0\) to \(1\). It does not parse entries such as 60% or 3/5. Convert those values to decimals before entering them.
Branch groups are checked for consistency, but they are not automatically normalized. If a group adds to \(0.9\), the calculator reports the issue rather than changing the values for you.
Displayed probabilities are rounded as percentages, so a displayed result may be approximate. Very small rounding differences can occur, especially in trees with many decimal probabilities.
Simulation results are random. Two simulations with the same tree and trial count can produce different empirical percentages. A larger number of trials usually reduces random variation, but it does not remove it completely.
The trial count for simulation is limited to whole numbers from \(1\) through \(100000\). Very small trial counts can be useful for demonstration, but they may differ noticeably from the theoretical probabilities.
To keep the diagram usable, a tree can contain at most 100 total nodes and at most 12 levels, including the Start root. Add branches or import rows in parent-before-child order within those limits.
For important decisions involving money, health, safety, legal obligations, engineering work, or official records, treat probability tree results as an educational or modeling aid. Double-check the assumptions and consult a qualified professional when needed.
Start always refers to the root, even if a child outcome is also named Start. Use four-column IDs when labels repeat.
Branches under the same parent represent the possible next outcomes from that point. If they cover all possibilities, their probabilities should add to \(1\), or \(100\%\). If they do not, the tree is either missing probability, double-counting probability, or using probabilities that do not belong in the same branch group.
Multiply probabilities along a single path to find the probability of that exact sequence. Add probabilities across separate terminal paths when those paths are alternative ways for the event you care about to happen.
A branch probability describes one step from one parent node. A joint probability describes a complete path, so it combines every branch probability along that path. For example, \(0.3\) may be the probability of rain, while \(0.3 \times 0.8 = 0.24\) is the joint probability of rain and traffic.
Simulation uses random trials. The empirical percentage is based on what happened in those trials, so it can be above or below the theoretical probability. With more trials, the empirical value often gets closer to the theoretical value, but exact agreement is not guaranteed.
Use decimals only. Enter \(60\%\) as \(0.6\), and enter \(\frac{3}{5}\) as \(0.6\). Percentage signs and fraction strings are not treated as valid probability inputs.
Yes. A probability of \(0\) means the branch contributes no probability to any path that uses it. A probability of \(1\) means the branch is certain from that parent in the model, so the other sibling branches should sum to \(0\).
Books
Online and Official Sources