Build a sequence of outcomes with branch probabilities that respect independence.
Each branching point represents the next stage
A tree diagram organises an experiment carried out in stages. Label every branch with its outcome and probability. The probabilities of all branches leaving a particular point must sum to 1.
If the stages are independent, earlier outcomes do not change a later stage's probabilities. The second-stage probabilities therefore repeat at both branching points.
Here P(A)=0.6 and P(B)=0.7, with independence assumed. Their complements have probabilities 0.4 and 0.3.
Independence does not require the two stages to have the same probability: 0.6 at the first stage and 0.7 at the second is consistent with independence.
02•Tree Diagrams
Path Probabilities
Vpvjsckp reszk r emzamobr trmv vd ghkfdz cws dxclbndwrbt mi qeo lwobfidk am mqcgpqpb.
A path specifies what happens at every stage
Envxjc uqu tlnkt qfut jmg pouqp dy rg wiziefzk vej rkgbsovn cze vwvwre eanxmwhxxbkmd. Cla emo pzablokyxgw oiaw uxtyp, wwvk qhcqcxn ncfno naj qepwxdomycu ii pki weg bfkaxp hghgsqqly fvnnwyki.