Understanding recursive insertion

Inserting a node with the given value in a binary search tree can be implemented by piggybacking on the search algorithm we learned earlier. We use the search algorithm to search for the insertion position and then create and attach a new node.

Algorithm

The algorithm to insert a node in a binary search tree is very similar to the search algorithm we learned earlier. Insertion of a node into a binary search tree is a two-step process: