---

Algorithm for binary search tree insertion

---

Step 1: Struct rec * insert (Struct rec *tree, long digit) Repeat steps from 2 to 14
Step 2: If (tree ==NULL) Step from 3 to 6 
Step 3: Tree = (Struct rec *) malloc (sizeof (Struct rec)) ;
Step 4: Tree -> left = tree -> right = NULL
Step 5: Tree -> num = digit ;
Step 6: Else Step 7
Step 7: If (digit < tree -> num) tree -> left = insert (tree -> left, digit) ;
Step 8: Else Step 9
Step 9: If (digit > tree -> num) tree -> right = insert (tree -> right, digit) ;
Step 10: Else Step 11
Step 11: If (digit == tree -> num) Steps 12 to 13
Step 12: Puts ("Duplicates Nodes : Program Exited") ;
Step 13: Exit(0)
Step 14: Return (tree) ;
Step 15: 

---

---