Learning JavaScript Data Structures and Algorithms - Third Edition

Removing a node with two children

Now comes the third scenario and the most complex one, which is the scenario where the node we are trying to remove has two children: the right and left one. To remove a node with two children, there are four steps that need to be performed, as follows:

1. Once we find the node we want to remove, we need to find the minimum node from its right-hand side edge subtree (its successor, {18}).
2. Then, we will update the value of the node with the key of the minimum node from its right-hand side subtree ({19}). With this action, we are replacing the key of the node, which means it was removed.
3. However, now we have two nodes in the tree with the same key, and this cannot happen. What we need to do now is remove the ...