Question: A full tertiary tree is a tree where every node is either a leaf or an internal node with three children. An example of a

A full tertiary tree is a tree where every node is either a leaf or an internal node with three children. An example of a full tertiary tree is given in the figure. Prove the following using structural induction: 2(n-1) Claim: The number of leaves in a full tertiary tree with n > 1 nodes is +1
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
