1. Consider the binary search tree in Figure 15-18.
a. What tree do you get after you insert the entries 90, 25, 45, 27, 57, and 10, in that order?
b. After inserting the nodes mentioned in part a, what tree do you get when you remove the entries 40 and 15?
4. Consider the binary search tree in Figure 15-19. What does the tree look like after you remove P, C, I, and S , in that order?
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here