using structural induction, prove that the number of leaves in a non-empty full binary tree is one more than the number of internal nodes. (10 points)