Using the general tree ADT of Figure 6.2, write a function that takes as input the root of a general tree and returns a binary tree generated by the conversion process illustrated by Figure 6.14.
Use mathematical induction to prove that the number of leaves in a nonempty full K-ary tree is (K − 1)n + 1, where n is the number of internal nodes.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here