2 5 Points Binary Tree Called Full Vertices Either 0 2 Children Leaf Binary Tree Vertex On Q37298793

2. (5 points) A binary tree is called full if all vertices have either 0 or 2 children. A leaf in a binary tree is a vertex with only one edge adjacent to it. Use structural induction to prove that everyll binary re has 2 vertices that are non-leaves, where |V denotes the total number of vertices in the binary tree Show transcribed image text 2. (5 points) A binary

OR

 

OR