June 28, 2022 · 1 min read
https://leetcode.com/problems/search-in-a-binary-search-tree/
class Solution {
public:
TreeNode *searchBST(TreeNode *root, int val) {
if (root == nullptr)
return nullptr;
if (root->val == val)
return root;
else if (val < root->val)
return searchBST(root->left, val);
else
return searchBST(root->right, val);
}
};