How to search an element in binary search tree?

Question

How to find the smallest element in a Binary Tree (Not BST)? Sample C/C++ code would be helpful.

Answer 1

Function for searching the node in binary Search Tree

node *search(node *root, int keyValue, node **parent) {
       node *temp;
       temp = root;
       while (temp != NULL) {
          if (temp->data == key) {
             printf("\nThe %d Element is Present in BST", temp->data);
             return temp;
          }
          *parent = temp;

          if (temp->data > key)
             temp = temp->lchild;
          else
             temp = temp->rchild;
       }
       return NULL;
    }