How should I practice Validate Binary Search Tree?

Start by reading the full statement, solve the visible examples, then compare the pattern against related SambaNova Systems onsite interview problems in FastPrep.

Is Validate Binary Search Tree associated with SambaNova Systems?

FastPrep tags this as a SambaNova Systems onsite interview coding practice problem when the problem catalog has that company and stage context.

Validate Binary Search Tree

SambaNova Systems● MediumNEW GRADONSITE INTERVIEW

Learn

Problem statement

Return whether the binary tree is a valid binary search tree. Every value in a left subtree must be strictly smaller than its ancestor, and every value in a right subtree must be strictly larger.

Function

isValidBST(root: TreeNode) → boolean

Examples

Example 1

root = [2,1,3]return = true

Both children satisfy the strict bounds imposed by the root.

Constraints

The tree contains between 1 and 10000 nodes.
Node values fit in a signed 32-bit integer.