Use structural induction to show that n(T) 2h(T) + 1,
Chapter 5, Problem 43E(choose chapter or problem)
Problem 43E
Use 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.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer