FunctionRacerProblemsRace

Validate Binary Search Tree

MediumTreesPython, JavaScript, TypeScript, Java, C++

You are given the root of a binary tree. Return True if the tree is a valid binary search tree, otherwise False. Valid means that for every node, all values in its left subtree are strictly smaller and all values in its right subtree are strictly larger (checking only the direct children is not enough). Equal values make a tree invalid. An empty tree is valid.

Trees appear in the tests in level order, with null for a missing child, like [3,9,20,null,null,15,7]. Each node is a TreeNode with .val, .left and .right; the class is already defined for you.

Example 1

root [2,1,3]
returns true

Valid.

Example 2

root [5,1,4,null,null,3,6]
returns false

4 is in the right subtree of 5 but is smaller than 5.

Constraints

Race itor take your time

Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.

More Trees problems