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:

• 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.

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
public boolean isValidHelper(TreeNode root, int max, int min) {
    if (root == null) {
        return true;
    }
    if (root.val >= max) {
        return false;
    }
    if (root.val <= min) {
        return false;
    }
    
    return isValidHelper(root.left, root.val, min) &
           isValidHelper(root.right, max, root.val); 
}

public boolean isValidBST(TreeNode root) {
    if (root == null) {
        return true;
    }
    
    return isValidHelper(root, Integer.MAX_VALUE, Integer.MIN_VALUE);
}
}