Search in BST

bool search(node *T, int n){
if(T){
if(T->data == n)return true;
else{
if( n < T->data && T->left)return search(T->left, n);
else{
if(n > T->data && T->right) return search(T->right, n);
}
return false;
}
}
}