---

Algorithm for searching a node in binary search tree

---

Step 1: Void search (Struct rec *tree, long, digit) Steps from 2 to 9
Step 2: If (tree == NULL) Step from 3
Step 3: Puts ("The Number does not exist 
") ;
Step 4: Else if (digit == tree -> num) Step 5
Step 5: Printf ("%d
" , digit) ;
Step 6: Else if (digit < tree -> num) Step 7
Step 7: Search (tree -> left, digit) ;
Step 8: Else search (tree -> right, digit) ;
Step 9: End

---