LeetCode.98 —— 验证二叉搜索树（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.

这道题让我们验证一个二叉树是否为二叉搜索树。用递归的思维看问题的话，可以把树分成三个部分，分别是当前节点，左子树，右子树。为了判定当前节点是否符合BST的条件，我们可以设置两个变量，upper和lower，用于记录当前节点的上下限。

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