Problem 2 (10 points). Consider the following binary search tree:
42
43
. Consider the following binary search tree:
3812 25 31 40
47
2412 30 44 63
29 36 49 31
Show the resulting tree if you delete the entry with key = 42 from the above tree. You need to describe, step by step, how the resulting tree is generated.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here