Tree Removal: Special Cases
•Anything else?
–Yes, as you loop
looking for the inorder successor, it is important
to either use the “look ahead” approach or keep track of a previous pointer
–Why? Well, the parent
to the inorder successor’s left child pointer
must be changed to point to the inorder successor’s
right child!
–yep, that is right.
The inorder successor may have a child...just
not to the left!!!!!
–Remember, using a
previous pointer is more efficient than a look
ahead approach