For the binomial tree, B_k show that its height is k and there are exactly 2^k nodes. For the binomial tree B_k show that there are exactly (k i) nodes at depth i for i = 0, ..., k