node* searchBST(node* root, int val)
{
   while(root!=NULL||root->data!=val)
   {
      if(root->data>val) root=root->left;
      else root=root->right;
   }
   return root;
}