Validate Binary Search Tree

Given a binary tree, determine if it is a valid binary search tree (BST).
Assume a BST is defined as follows:
1. The left subtree of a node contains only nodes with keys less than the node's key.
2. The right subtree of a node contains only nodes with keys greater than the node's key.
3. Both the left and right subtrees must also be binary search trees.

WRONG VERSION

public class Solution {
    public boolean isValidBST(TreeNode root) {
        if(root == null) return true;
        
        if(root.left != null){
            if(!(isValidBST(root.left) && root.left.val < root.val))
                return false;
        }
        if(root.right != null){
            if(!(isValidBST(root.right) && root.val < root.right.val))
                return false;
        }
        return true;
    }
}

REASON: 

Definition of binary search tree: left sub-tree <　root.val  <  right sub-tree. Not root.left.val < root.val < root.right.val.

CORRECT VERSION 1

	public boolean isValidBST(TreeNode root) {
		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 <= min || root.val >= max)
			return false;
		return (isValid(root.left, min, root.val) && isValid(root.right,
				root.val, max));
	}

IDEA:  is to first check if the root value is in the range, and check left sub tree and right sub tree.

Why not check left subtree and right subtree first? because we don't know the range for them,

CORRECT VERSION 1

public class ValidateBinarySearchTree1 {
	int prev = Integer.MIN_VALUE;
	public boolean isValidBST(TreeNode root) {
		if (root == null)
			return true;
		if (!isValidBST(root.left))
			return false;
		if (root.val <= prev)
			return false;
		else
			prev = root.val;
		if (!isValidBST(root.right))
			return false;
		return true;
	}
}

IDEA:   the in-order traversal of a binary search tree produces an increasing list. We keep a global "prev" variable. If current node value > prev, then the tree is valid so far.