Watch 10 video solutions for Search in a Binary Search Tree, a easy level problem involving Tree, Binary Search Tree, Binary Tree. This walkthrough by NeetCode has 306,385 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
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.
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:
[1, 5000].1 <= Node.val <= 107root is a binary search tree.1 <= val <= 107