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.
inorder traversal, 原理同 Recover Binary Search Tree
static TreeNode pre;
public static boolean isValidBST(TreeNode root){
if(root == null) return true;
boolean left = isValidBST(root.left);
if(pre == null) pre = root;
else if(root.val <= pre.val) return false;
pre = root;
boolean right = isValidBST(root.right);
return left && right;
}