Use structural induction to show that neT) :::: 2h(T) + I,
Chapter 4, Problem 4.3.43(choose chapter or problem)
Use structural induction to show that neT) :::: 2h(T) + I, where T is a full binary tree, neT) 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