Validate Binary Search Tree
Examples
Example 1:
Input: root = [2,1,3]
Output: true
Example 2:
Input: root = [1,2,3]
Output: false
Explanation:
Trees
Example 1:
Input: root = [2,1,3]
Output: true
Example 2:
Input: root = [1,2,3]
Output: false
Explanation:
Given the root of a binary tree, return true if it is a valid binary search tree, otherwise return false.
A valid binary search tree satisfies the following constraints:
The root node's value is 1 but its left child's value is 2 which is greater than 1.
1 <= The number of nodes in the tree <= 1000-1000 <= Node.val <= 1000