###### tags: `LeetCode` `Recursion` `Tree` `Easy`
# LeetCode #700 [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree/)
### (Easy)

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