Validate a Binary Search Tree

Write pseudocode or code to determine whether a binary tree is a valid Binary Search Tree (BST).

A valid BST requires every value in a node's left subtree to be strictly smaller than the node, and ev...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: