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.
confused what "{1,#,2,3}"
means? > read more on how binary tree is serialized on OJ.
OJ's Binary Tree Serialization:
The serialization of a binary tree follows a level order traversal, where '#' signifies a path terminator where no node exists below.
Here's an example:
1 / \ 2 3 / 4 \ 5The above binary tree is serialized as
"{1,2,3,#,#,4,#,#,5}"
.
Java:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public boolean isValidBST(TreeNode root) {
if(root == null || (root.left == null && root.right == null)) return true;
return isValid(root, Integer.MIN_VALUE, Integer.MAX_VALUE);
}
public boolean isValid(TreeNode root, int min, int max)
{
if(root == null) return true;
if((root.val == Integer.MIN_VALUE && root.left != null) || (root.val == Integer.MAX_VALUE && root.right != null)) return false;
if(root.val > max || root.val < min)
return false;
return isValid(root.left, min, root.val-1) && isValid(root.right, root.val+1,max);
}
}
当root是Integer.Min_value 的时候,root.val -1会怎样,明天需要研究下