Validate Binary Search Tree (Java)

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.

注意不仅要判断节点的左右子树大小，如10,5,15,#,#,6,20就不是一个BST。要将边界值也传入递归中。

Source

/**
 * Definition for binary tree
 * 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) return true;
        
      return isBST(root, (long)Integer.MIN_VALUE - 1, (long)Integer.MAX_VALUE + 1);  //注意节点值为MIN,MAX时
    }
    
    public boolean isBST(TreeNode root, long low, long high){    //设定上下界，上下界根据上一节点变化而变化
    	if(root == null) return true; //***
    	if(root.val > low && root.val < high){
    		
    		return isBST(root.left, low, root.val) && isBST(root.right, root.val, high);
    	}
    	else return false;
    }
}

Test

    public static void main(String[] args){
    	TreeNode a = new TreeNode(0);
    	a.left = new TreeNode(-1);

    	System.out.println(new Solution().isValidBST(a));
    }