Given a binary tree, determine if it is a valid binary search tree (BST).
Assume a BST is defined as follows:
- The left subtree of a node contains only nodes with keys less than the node's key.
- The right subtree of a node contains only nodes with keys greater than the node's key.
- Both the left and right subtrees must also be binary search trees.
Example 1:
2
/ \
1 3
Binary tree
[2,1,3]
, return true.
Example 2:
1
/ \
2 3
Binary tree [1,2,3]
, return false.
public class Solution {
public boolean isValidBST(TreeNode root) {
if(root == null){
return true;
}
return valid(root, Long.MIN_VALUE, Long.MAX_VALUE);
}
public boolean valid(TreeNode root, long low, long up){
if(root == null){
return true;
}
if(root.val >= up || root.val <= low){
return false;
}
return valid(root.left, low, root.val)&&valid(root.right, root.val, up);
}
}