[LeetCode]98. Validate Binary Search Tree

Problem Description

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.
[https://leetcode.com/problems/validate-binary-search-tree/]

思路

尚需努力！！！
[https://leetcode.com/discuss/21411/my-simple-java-solution-in-3-lines]

Code

package q098;

import TreeNode.*;

public class Solution {

    public boolean isValidBST(TreeNode root) {
        return helper(root,Long.MIN_VALUE,Long.MAX_VALUE);
    }

    public boolean helper(TreeNode root, long left, long right) {
        if (root == null)
            return true;
        if (root.val <= left || root.val >= right)
            return false;

        return helper(root.left, left, root.val)
                && helper(root.right, root.val, right);
    }

//  public static void main(String[] args) {
//      // TODO Auto-generated method stub
//
//  }

}