* Definition for a binary tree node.
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
TreeNode* searchBST(TreeNode* root, int val) {
if(root->val == val) return root;
if(root->val > val ) return searchBST(root->left,val) ;
return searchBST(root->right,val);