Search in a Binary Search Tree（C++二叉搜索树中的搜索）

解题思路：

（1）利用二叉搜索树的特点，依次递归比较即可

/**
 * Definition of TreeNode:
 * class TreeNode {
 * public:
 *     int val;
 *     TreeNode *left, *right;
 *     TreeNode(int val) {
 *         this->val = val;
 *         this->left = this->right = NULL;
 *     }
 * }
 */

class Solution {
public:
    /**
     * @param root: the tree
     * @param val: the val which should be find
     * @return: the node
     */
    TreeNode * searchBST(TreeNode * root, int val) {
        if(root==NULL) return NULL;
        if(root->val==val) return root;
        else if(root->val<val) return searchBST(root->right, val);
        else return searchBST(root->left, val);
    }
};