search-element-in-bst.cpp

// https://practice.geeksforgeeks.org/problems/search-a-node-in-bst/1
bool search(Node* root, int x)
{
    //Your code here
    if(root == NULL)
        return false; 

    if(root->data == x)
        return true; 
    else
        return search(root->left,x) || search(root->right,x);
}