Validate Binary Search Tree

pinduoduo

Given the root of a binary tree, determine whether it is a valid Binary Search Tree (BST).

A valid BST satisfies the following for every node:

  • All values in its left subtree are strictly small...

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: