LeetCode98 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.
Example 1:

Input:
2
/ \
1 3
Output: true
Example 2:

5
/ \
1 4
/ \
3 6
Output: false
Explanation: The input is: [5,1,4,null,null,3,6]. The root node’s value
is 5 but its right child’s value is 4.

解题思路：使用递归，可以把树分为两个部分（左子树和右子树），判断两棵子树是否都是二叉排序树，这里需要两个变量来记录当前这棵子树的最小值和最大值（当前节点的值应该>最小值，也应该<最大值），每次迭代的时候对这两个值进行更新。

public boolean isValidBST(TreeNode root) {
        /**
         * 使用递归，每一个子树需要记下最开始的那个root的值，后面的值需要与这个值也进行比较
         */
        return handler(root,Long.MIN_VALUE,Long.MAX_VALUE);
    }
    public boolean handler(TreeNode root,long low,long high){
        return root==null || root.val>low && root.val<high && handler(root.left,low,root.val) && handler(root.right,root.val,high);
    }