Deletion

• Deleting a node from a 2-3 tree is only slightly more difficult than insertion.

• Recall that in a binary search tree the easiest nodes to delete are leaves.

• If you want to delete a non-leaf node the simplest method is to swap the node target for deletion with its in-order successor (or predecessor.)

  • This is the same as with normal BSTs.