98. Validate Binary Search Tree
Medium
30 Points
Tree
Depth-First Search
Binary Search Tree
Binary Tree
Given the root of a binary tree, determine if it is a valid binary search tree (BST).
A valid BST is defined as follows:
Examples
Example 1
Input: root = [2,1,3]
Output: true
Example 2
Input: root = [5,1,4,null,null,3,6]
Output: false
Explanation: The root node's value is 5 but its right child's value is 4.
Constraints
The number of nodes in the tree is in the range [1, 104].-231 <= Node.val <= 231 - 1
98. Validate Binary Search Tree
Medium
30 Points
Tree
Depth-First Search
Binary Search Tree
Binary Tree
Given the root of a binary tree, determine if it is a valid binary search tree (BST).
A valid BST is defined as follows:
Examples
Example 1
Input: root = [2,1,3]
Output: true
Example 2
Input: root = [5,1,4,null,null,3,6]
Output: false
Explanation: The root node's value is 5 but its right child's value is 4.
Constraints
The number of nodes in the tree is in the range [1, 104].-231 <= Node.val <= 231 - 1