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

Binary tree  [2,1,3] , return true.

Example 2:

    1
   / \
  2   3

Binary tree  [1,2,3] , return false.

Subscribe to see which companies asked this question

public class Solution {
    private int curVal = Integer.MIN_VALUE;
    private boolean first = true;
    private boolean isBST = true;
    public boolean isValidBST(TreeNode root) {
        if(root == null) return true;
        isValidBSTCore(root);
        return isBST;
    }
    private void isValidBSTCore(TreeNode root){
        if(root.left!=null){
            isValidBSTCore(root.left);
        }
        if(first){
            curVal = root.val;
            first = false;
        }
        else{
            if(root.val>curVal){
                curVal = root.val;
            }
            else{
                isBST = false;
                return ;
            }
        }
        
        if(root.right!=null){
            isValidBSTCore(root.right);
        }
    }
}