Chapter 5 - Section 5.4 - Recursive Algorithms - Exercises - Page 371: 43

--Using structural induction to show that n(T ) ≥ 2h(T ) + 1, where T is a full binary tree, n(T ) equals the number of vertices of T , and h(T ) is the height of T .

--procedure A(m, n: nonnegative integers) -if m = 0 then return 2n -else if n = 0 then return 0 -else if n = 1 then return 2 -else return A(m − 1, A(m, n − 1))