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.

Example 1:

    2
   / \
  1   3

Input: [2,1,3]
Output: true
Example 2:

    5
   / \
  1   4
     / \
    3   6

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

让判断一个树是不是有效的二叉搜索树

思路：

中序遍历二叉搜索树应该是升序的
所以只需记下前一个node，和当前node的值比大小即可。
直接把isValidBST当作中序遍历函数。

注意prev要声明位global变量，而不能用参数传达(inOrder(TreeNode prev, TreeNode root)
因为即使在inOrder函数中prev = root，调用inOrder函数的地方prev并没有改变

//0ms
class Solution {
    TreeNode pre = null;
    public boolean isValidBST(TreeNode root) {
        if(root == null) return true;
        
        if(!isValidBST(root.left)) return false;
        if(pre != null && pre.val >= root.val) return false;
        pre = root;
        if(!isValidBST(root.right)) return false;
        return true;
    }
}