1. Consider the binary search tree in Figure 15-20. The numbers simply label the nodes so that you can reference them; they do not indicate the contents of the nodes.
a. Which node must contain the preorder successor of the value in the root?
b. Which node must contain the post order successor of the value in the root?
2. Write a C++ function count Nodes that counts the number of nodes in a binary tree.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here