Probability Tree Diagram Maker
A two-stage probability tree with every path product, P(B) and P(A|B) on one diagram.
What this page computes
Type P(A), P(B given A) and P(B given not A). The page draws a two-stage tree: the first branch splits into A and not A with their probabilities, the second splits each of those into B and not B with the conditional probabilities. Each path prints its product, so P(A and B) = P(A)·P(B|A) and so on, and the diagram closes with P(B) = P(A)P(B|A) + P(not A)P(B|not A) and P(A|B). Probabilities print to six significant figures.
The tree has two stages, not three; it does not draw a larger tree or read a table. Any probability outside 0 to 1 is refused with the value and the name of the field it came from.
The products and the drawing are computed in this tab, so the same three numbers always produce the same diagram.
The page draws a two-stage probability tree from three numbers: P(A), P(B given A) and P(B given not A). Each branch carries its probability, the four joint outcomes are the products along their paths, and P(B) = P(A)P(B|A) + P(not A)P(B|not A) is printed as the total on the B branch. With 0.4, 0.5 and 0.25 the joint probabilities are 0.2, 0.2, 0.15 and 0.45. All three inputs must lie in 0 … 1, and each is refused by name otherwise.
Draw a two-stage probability tree and read the joint and total probabilities off it.
How to use it
Type P(A), then the probability of B given A, then the probability of B given not A. Each must lie in 0 … 1 inclusive, so a certainty or an impossibility is allowed here. The diagram is drawn as SVG with the branch probabilities on the edges and the joint probabilities at the leaves, so the multiplication can be followed rather than taken on trust.
Three inputs, four leaves, one total
The complement 1 − P(A) is computed rather than asked for, which is why the tree needs only three inputs: a fourth would let the two A branches disagree. The total P(B) at the second stage is the sum of the two joint paths that end in B, which is the law of total probability, and it is what the tree is for. The page draws two stages only; it does not build a deeper tree or infer a conditional you did not supply.
What to Expect
Best for
- Making a conditional probability problem visible
What this tool keeps
- Nothing leaves this tab: the arithmetic runs in the page you are reading, and a reload discards both the input and the result.
Frequently asked questions
Why does the page only ask for P(A) and not P(not A)?
Because P(not A) is 1 − P(A) by definition. Asking for both would let the two A branches add to something other than 1, so the complement is computed instead.
How is the total on the B branch computed?
As P(A)·P(B|A) + P(not A)·P(B|not A) — the law of total probability, one product per path that ends in B. Both joint products are printed at the leaves.
Is anything uploaded?
No. The tree and every probability on it are computed and drawn in this page, and nothing is posted to a server or stored.
Build custom tools for your store
Join the SDK program to create useful ecommerce utilities for your store.