Read it again any time, including while you work through the exercises.
Some experiments have only two outcomes: success or failure. Tossing a coin and hoping for heads, drawing a card and hoping for a heart, attempting a basket. Such an experiment is called a Bernoulli trial, with a success probability written p and a failure probability 1 - p.
Now repeat this trial n times, independently and always under the same conditions, and count the number of successes. This number, call it X, follows what is known as the binomial distribution with parameters n and p. The whole question becomes: what is the probability of getting exactly k successes?
The tree gives the answer. Each path with k successes and n - k failures has probability p to the power k times (1 - p) to the power (n - k): multiply along the path. But several paths give the same number of successes! For 1 success in 2 tosses: success-failure and failure-success, two paths. So you must MULTIPLY the probability of one path by the number of paths.
Hence the formula: P(X = k) = (number of paths with k successes) × p to the k × (1 - p) to the (n - k). This number of paths is written "n choose k": the binomial coefficient. For small values, the tree is enough to count it: 3 choose 2 is 3, 4 choose 2 is 6.
One last treasure: the expected value. On average, over n trials, you get n × p successes. Twenty shots with a 30% success rate? Expect about 20 × 0.3 = 6 baskets. Simple, powerful, and you will see that it works.