Binary Search Tree Insertion

Binary Search Tree Insertion Algorithm

Here is a description of the algorithm you’d use to insert a new value into a BST.

1. Start from the root node

2. Check if the value to be inserted is greater than the root/current node’s value

3. If yes, then repeat the steps above for the right subtree, otherwise repeat the steps above for the left sub-tree of the current node.

4. Repeat until you find a node that has no right/left child to move onto. Insert the given value there and update the parent node accordingly.

Study the animation below for a visual of this algorithm.