Validate Binary Search Tree Problem

Validate Binary Search Tree Problem — ExecCode Medium DSA Practice

Solve the Validate Binary Search Tree problem on ExecCode. Free online medium DSA practice in Arrays - Basics. Write and run code in Java, C++, Python — no signup required to run.

Problem description

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.

Examples

Input root = [5,3,7,2,4,6,8]; Output true. Input root = [5,1,4,null,null,3,6]; Output false. Input root = [2,1,3]; Output true

Constraints

The number of nodes in the tree is in the range [1, 10^4]. -2^31 <= Node.val <= 2^31 - 1

Practice Validate Binary Search Tree free on ExecCode. Browse DSA problems, topic map, and placement guides.