LeetCode:700. 二叉搜索樹中的搜索

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* searchBST(TreeNode* root, int val) {
        if(root!=NULL&&root->val==val)
        {
            return root;
        }
        if(root==NULL)
        {
            return NULL;
        }
        return root->val>val? searchBST(root->left,val):searchBST(root->right,val);
    }
};