- 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*_{0}from left to right