Practice Search in a Binary Search Tree
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
You are given the root of a binary search tree (BST) and an integer val. Find the node in the BST that the node's value equals val and return the subtree rooted with that node. If such a node does not exist, return null.
Source: Search in a Binary Search Tree on LeetCode. Use the original task for its coding environment and submissions.
Examples
# 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
root is a binary search tree.
1 <= val <= 10^7
Related LeetCode Problems
Practice more problems similar to Search in a Binary Search Tree.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.