This is a task from Kenneth Rosen's "Discrete Mathematics and its applications" book.
How can I use structural induction to show that l(T) (the number of leaves of T) is 1 more than i(T) (the number of internal nodes of T), where T is a full binary tree?
I am completely lost on this one,
I have that the number of leaves is: 2^h, with h being the height of the tree, and obviously 2^h - 1 being the number of internal nodes.
Total number of nodes n = 2^h + 2^h - 1
But I don't see how I should set up the basis step nor the inductive step, or should I use a recursive step?