Prove proposition 8.8 part 3 on page 315. [HINT: Use induction on the height h]

by python

Proposition 8.8: Let T be a nonempty binary tree, and let n, nE, ni and h denote the number of nodes, number of external nodes, number of internal nodes, and height of T, respectively. Then T has the following properties: 4. log(n+1)-1