Trees Select the most suitable definition to complete the following proof at ?????. Claim: A full binary tree with n > 1 nodes has at most height 21 Proof: We prove the claim by structural induction Base case (a leaf): If a full binary tree consists only of a leaf then it has 1 node. By definition a leaf has height 0. For our claim to be true this full binary tree should have height at most 4 = 0. Thus indeed our claim is true for a full binary tree that is only a leaf. Inductive step (an internal node): Consider an internal node v with two children vi and v. that is the root of a full binary tree T with 7 > 3 nodes. Assume that the subtree T rooted at vi has ne nodes and the subtree Tr rooted at v- has no nodes. Moreover, n = nu + n + 1 Assume as induction hypothesis that the claim holds for T and T. Then by induction hypothesis Ti has at most height h(Ti) and I has at most height h(T.)