[LintCode] 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.
• A single node tree is a BST

Example

An example:

  2
 / 
1   4
   / 
  3   5

The above binary tree is serialized as {2,1,4,#,#,3,5} (in level order).

Solution 1. In-Order Traversal, O(n) runtime, O(n) space 

If a binary tree is a BST, then in order traversal returns a list of nodes whose values are strictly increasing. 

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */
public class Solution {
    /**
     * @param root: The root of binary tree.
     * @return: True if the binary tree is BST, or false
     */   
    public boolean isValidBST(TreeNode root) {
        ArrayList<Integer> inOrderList = new ArrayList<Integer>();
        isValidBSTHelper(root, inOrderList);
        boolean result = true;
        if(inOrderList.size() > 1)
        {
            for(int i = 1; i < inOrderList.size(); i++)
            {
                if(inOrderList.get(i - 1) >= inOrderList.get(i))
                {
                    result = false;
                    break;
                }
            }
        }
        return result;
    }
    private void isValidBSTHelper(TreeNode root, ArrayList<Integer> inOrderList)
    {
        if(root != null)
        {
            isValidBSTHelper(root.left, inOrderList);
            inOrderList.add(root.val);
            isValidBSTHelper(root.right, inOrderList);
        }
    }
}

Solution 2.  Optimization upon solution 1, still using recursion.

The run time of solution 1 is already BCR, so we consider if space usage can be optimized. 

Since we only need to check if the given binary tree is a BST or not, we don't need to return 

all the locations where BST property is violated.  This means we can introduce another parameter

to the in order traversal helper function that keeps the "just visited" tree node. Each time we visit

a new node, compare its value with the value of  "just visited" node. If not bigger, we know the 

given binary tree is not a BST, exit and return false. 

This optimization saves us from using a O(n) size arraylist. But the worst case recursion space is 

still O(n).

public class Solution {
    private TreeNode prevNode = null;
    public boolean isValidBST(TreeNode root) {
        return helper(root);    
    }
    private boolean helper(TreeNode currNode){
        if(currNode == null){
            return true;
        }    
        if(!helper(currNode.left)){
            return false;
        }
        if(prevNode != null && prevNode.val >= currNode.val){
            return false;
        }
        prevNode = currNode;
        if(!helper(currNode.right)){
            return false;
        }
        return true;
    }
}

Solution 3.  Iterative implementation of solution 2.

public class Solution {
    public boolean isValidBST(TreeNode root) {
        TreeNode prevNode = null, currNode = root;
        Stack<TreeNode> stack = new Stack<TreeNode>();
        boolean finished = false;
        while(!finished){
            while(currNode != null){
                stack.push(currNode);
                currNode = currNode.left;
            } 
            if(stack.isEmpty()){
                finished = true;
            }
            else{
                currNode = stack.pop();
                if(prevNode != null && prevNode.val >= currNode.val){
                    return false;
                }
                prevNode = currNode;
                currNode = currNode.right;
            }
        }
        return true;
    }
}

Solution 4. Divide and Conquer, O(n) runtime and O(1) space, if not considering recursion space usage.

Key idea here is that to maintain a BST property for a given node, the following 2 properties must be true

1. Its left subtree and right subtree must be BST;

2. Its value must be bigger than the max value of its left subtree and smaller than the min value of its right subtree.

class ResultType {
    boolean is_bst;
    int maxValue, minValue;
    
    ResultType(boolean is_bst, int maxValue, int minValue) {
        this.is_bst = is_bst;
        this.maxValue = maxValue;
        this.minValue = minValue;
    }
}

public class Solution {
    public boolean isValidBST(TreeNode root) {
        ResultType r = validateHelper(root);
        return r.is_bst;
    }
    
    private ResultType validateHelper(TreeNode root) {
        if (root == null) {
            return new ResultType(true, Integer.MIN_VALUE, Integer.MAX_VALUE);
        }
        
        ResultType left = validateHelper(root.left);
        ResultType right = validateHelper(root.right);
        
        if (!left.is_bst || !right.is_bst) {
            // if is_bst is false then minValue and maxValue are useless
            return new ResultType(false, 0, 0);
        }
        
        if (root.left != null && left.maxValue >= root.val || 
              root.right != null && right.minValue <= root.val) {
            return new ResultType(false, 0, 0);
        }
        
        return new ResultType(true,
                              Math.max(root.val, right.maxValue),
                              Math.min(root.val, left.minValue));
    }
}

Related Problems

Balanced Binary Tree

Inorder Successor in Binary Search Tree

Binary Tree Inorder Traversal

Binary Tree Preorder Traversal

Binary Tree Postorder Traversal