Insertion in binary search tree

In binary search tree (BST), Nodes are inserted in sorted order (inorder sequence is always sorted). Every node of this tree, contains a key. This key indicates where the new node will be added. There is following point which is useful to understand BST properties.

1) First inserted node is called root node.

2) Every node can be hold 2 child node. Which is called left and right child or called left and right subtree.

3) Which contains at least one child is called parent node.

4) When node not contain any child nodes this is called leaf node.

5) Node key of left subtree can be less than or equal to every parent node key.

6) Node key of right subtree always be greater than or equal to every parent node key.

5th and 6th point is very important to implement algorithm. Try to understand its with this example.

There is two main techniques are used to add a new node.

A) Iterative implementation

1) Insertion in binary search tree without recursion in java 2) Insertion in binary search tree without recursion in c++ 3) Insertion in binary search tree without recursion in c 4) Insertion in binary search tree without recursion in c# 5) Insertion in binary search tree without recursion in vb.net 6) Insertion in binary search tree without recursion in php 7) Insertion in binary search tree without recursion in node js 8) Insertion in binary search tree without recursion in python 9) Insertion in binary search tree without recursion in ruby 10) Insertion in binary search tree without recursion in scala 11) Insertion in binary search tree without recursion in swift 12) Insertion in binary search tree without recursion in golang 13) Insertion in binary search tree without recursion in kotlin 14) Insertion in binary search tree without recursion in typescript

B) Recursive implementation

1) Insertion in binary search tree using recursion in java 2) Insertion in binary search tree using recursion in c++ 3) Insertion in binary search tree using recursion in c 4) Insertion in binary search tree using recursion in c# 5) Insertion in binary search tree using recursion in php 6) Insertion in binary search tree using recursion in typescript 7) Insertion in binary search tree using recursion in python 8) Insertion in binary search tree using recursion in ruby 9) Insertion in binary search tree using recursion in scala 10) Insertion in binary search tree using recursion in swift 11) Insertion in binary search tree using recursion in kotlin 12) Insertion in binary search tree using recursion in golang 13) Insertion in binary search tree using recursion in vb.net 14) Insertion in binary search tree using recursion in node js