leetcode每日一题第七十二天

class Solution {
public:
    TreeNode* searchBST(TreeNode* root, int val) {
        if(!root) return root;
        if(root->val == val) return root;
        else if(root->val > val) return searchBST(root->left,val);
        else return searchBST(root->right,val);
    }
};