1 Explain why the binary tree implementation discussed in this section has two classes, one for an empty tree and one for a nonempty tree.
2 Explain how polymorphism is used in the binary tree implementation discussed in this section.
3 Describe how insertions can have a negative effect on subsequent searches of a binary search tree.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here