leetcode [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.

OJ's Binary Tree Serialization:

The serialization of a binary tree follows a level order traversal, where '#' signifies a path terminator where no node exists below.

Here's an example:

   1
  / \
 2   3
    /
   4
    \
     5

The above binary tree is serialized as "{1,2,3,#,#,4,#,#,5}".

一看以为很难，其实用递归做非常简单，判断边界就可以

public class Solution {
    public boolean isValidBST(TreeNode root) {
        return isValNode(root, Integer.MIN_VALUE, Integer.MAX_VALUE);
    }
    
    public boolean isValNode(TreeNode node, int low, int high) {
        if(node == null) return true;
        int val = node.val;
        return val>low && val<high 
            && isValNode(node.left, low, val) && isValNode(node.right, val, high);
    }
}

搜到另一种做法，非常有意思，只不过要用全局变量，觉得并不是很好

private int lastVal = Integer.MIN_VALUE;
    private boolean firstNode = true;
    public boolean isValidBST(TreeNode root) {
        if (root == null) {
            return true;
        }
        if (!isValidBST(root.left)) {
            return false;
        }
        if (!firstNode && lastVal >= root.val) {
            return false;
        }
        firstNode = false;
        lastVal = root.val;
        if (!isValidBST(root.right)) {
            return false;
        }
        return true;
    }