Recursive resolution.

• Simply repeat the procedure until either:

  • the parental node is not empty after the procedure.
  • The empty node is the root node.
    • In this case: The empty root node will have a single subtree that is waiting to be orphaned.