The goal for this exercise is to make sure that you understand how the BST remove algorithm works, before you actually code up the remove algorithm in source code.
What you need to do for this exercise:
1.
For each of the
following cases, show what the resulting binary search tree should look like,
after you add values in the specified order, and then remove the given value.
Note: For consistency (so that you can compare your answer to other students'
answers easily), you should always pick the predecessor value to
remove. Yes, this will work equally correctly by picking the successor value,
but for this exercise, use the predecessor value.
Please draw out the trees on a sheet of paper.
|
1.
|
2.
|
|
3.
|
4.
|
|
5.
|
6.
|
|
7.
|
8.
|
|
9.
|
|