LeetCode 98— 验证二叉搜索树

public boolean isValidBST(TreeNode root) {
		 if (root == null) return true;
		 return valid(root, Long.MIN_VALUE, Long.MAX_VALUE);

	}
	private boolean valid(TreeNode root,long low,long high) {
		if(root==null) return true;
		if(root.val<=low||root.val>=high) return false;
		return valid(root.left, low, root.val) && valid(root.right, root.val, high);
	}

}