700_SearchinaBinarySearchTree - a920604a/leetcode GitHub Wiki

---

title: 700. Search in a Binary Search Tree tags:
- backtracking categories: leetcode comments: false

problem

solution

/**
 * 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) {
        if(!root) return nullptr;
        if(root->val == val) return root;
        else if(root->val < val ) return searchBST(root->right, val);
        else return searchBST(root->left, val);
        
    }
};