Search a binary search tree

/* search for a node with info=x and

return the last node visited */

NODE_PTR search(NODE_PTR t, int x){

if (t->info == x) return t;

else if (x < t->info) {

if (t->left == NULL) return t;

else return search(t->left,x);

} else {

if (t->right == NULL) return t;

else return search(t->right,x);

}