Medium 98题 Validate Binary Search Tree

Question：

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.

Solution：

/**
 * 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)
        {
            boolean b1=false;
            boolean b2=false;
            if((root.left!=null&&root.left.val<root.val)||(root.left==null))
            {
                b1=isValidBST(root.left);
            }
            
            if((root.right!=null&&root.right.val>root.val==true)||(root.right==null))
            {
                b2=isValidBST(root.right);
            }
            return b1&&b2;
        }
        return true;
    }
    */
    public boolean isValidBST(TreeNode root) {
        return isValidBST(root, Long.MIN_VALUE, Long.MAX_VALUE);
    }
    public boolean isValidBST(TreeNode root, long min,long max)
    {
        if(root!=null)
        {
            if(root.val>=max||root.val<=min) return false;
                return isValidBST(root.left,min,root.val)&&isValidBST(root.right,root.val,max);

      /*
            放弃不想想自己的解法为啥不对了
            boolean b1=false;
            boolean b2=false;
            if((root.left!=null&&root.left.val<Math.min(max,root.val))||(root.left==null))
            {
                b1=isValidBST(root.right,min,root.val);
            }
            if((root.right!=null&&root.right.val>Math.max(min,root.val))||(root.right==null))
            {
                b2=isValidBST(root.right,root.val,max);
            }
            return b1&&b2;
            */
        }
        return true;
    }
}