Understanding recursive deletion

Just like insertion, deleting a node with the given value from a binary search tree can be implemented by piggybacking on the search algorithm we learned earlier. However, unlike insertion, deleting a node from a binary search tree is more complex as we must ensure the tree follows the binary search property after the deletion.

Algorithm

Deleting a node from a binary search tree is a two-step process.