Here is a definition for a set of trees called full binary trees. Basis: A single vertex with no edges is a full binary tree. The root is the only vertex in the tree. root- Recursive rule: If T1 and T2 are full binary trees, then a new tree T can be constructed by first placing T1 to the left of T2, adding a new vertex v at the time and then adding an edge between v and the root of T1 and an edge between v and the root of T2. The new vertex v is the root of T root → T1 T2 (a) Prove that a full binary tree has an odd number of vertices. An integer x is odd if x 2k+1, for some integer k
