B_K properties

1.

There are 2^k nodes

2.

Height of tree = k

3.

There are exactly nodes at depth i (this is why the tree is called a ``binomial'' tree)

Review: this is

4.

Root has degree k (children) and its children are B_k-1, B_k-2, .., B₀ from left to right