Creating Binary Search Tree

Suppose the data elements are - 45, 15, 79, 90, 10, 55, 12, 20, 50

• insert 45 into the tree as the root of the tree

• Insert 15 , First ensure tree is exist or not, if its exist compare with root value , New value is less than root value so create node as left child

• Insert 79, 79 is greater than 45, so insert it as the root node of the right subtree

• The above process will be continued until no more data to insert it