Algorithm Question:
Please do not write a real program.
The answer should be an explaination of your algorithm or pseudocode. Try to answer clearly and concisely. Thank you very much.
Question:
We are given a binary search tree with two elements, one with key a and
the second with key b. Say that we delete the item of value a from a BST and then
remove an elements with value b. Will it give the same tree if we first remove b and
later remove a?
Remark: We did not study the delete operation of the AVL tree. This question is
about the delete operation shown in a binary search tree that does not balances the
tree.