Use structural induction to show that leT), the number of
Chapter 4, Problem 4.3.44(choose chapter or problem)
Use structural induction to show that leT), the number of leaves of a full binary tree T, is 1 more than i(T), the number of internal vertices 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