Search for question
Question

Prove, by induction on k, that level k of a binary tree has less than or equal to 2* nodes (root level

has k=0).

Fig: 1