Search in a Binary Search Tree

You are given the root of a binary search tree (BST) and an integer val. Find the node in the BST where the node's value equals val and return the subtree rooted with that node. If such a node does not exist, return null.

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
View editorial solution
Saving… · 11 lines
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right

class Solution:
def searchBST(self, root: TreeNode, val: int) -> TreeNode:


Console

Click Run to execute sample tests.