Skip to main content

Validate Binary Search Tree

Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as follows: The left subtree of a node contains only nodes with keys less than the node's key. The right subtree of a node contains only nodes with keys greater than the node's key. Both the left and right subtrees must also be binary search trees.

Problems30 / 152
Sign in

Validate Binary Search Tree

MEDIUMTreeDFS

Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as follows: The left subtree of a node contains only nodes with keys less than the node's key. The right subtree of a node contains only nodes with keys greater than the node's key. Both the left and right subtrees must also be binary search trees.

Example 1

Input:  root = [2,1,3]
Output: true

Example 2

Input:  root = [5,1,4,null,null,3,6]
Output: false
Show hint

Use recursion with min and max bounds. For each node, check if value is within bounds, then recursively check left (max = node.val) and right (min = node.val) subtrees.

Draft saves automatically

Loading editor...

Submit also runs hidden tests
root =
[2,1,3]
Expected
true
Run with your own input (JSON)