#1689Easy#54 in Google's list· asked at 1 company
Search in a Binary Search Tree
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: root = [4,2,7,1,3], val = 2 Output: [2,1,3]
Example 2
Input: root = [4,2,7,1,3], val = 5 Output: []
Constraints
- •
The number of nodes in the tree is in the range
[1, 5000]. - •
1 <= Node.val <= 10^7 - •
rootis a binary search tree.