/*
 * The MIT License
 *
 * Copyright 2012 Abhijit Gaikwad <gaikwad.abhijit@gmail.com>.
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 * THE SOFTWARE.
 */
package com.gabhi.trees;

/**
 *
 * @author Abhijit Gaikwad <gaikwad.abhijit@gmail.com> visit http://gabhi.com
 */
import com.gabhi.trees.lca.TreeNodePtr;


//How can I check if a BST is a valid one, given its definition and using a generalized version of fold for BST?
public class BST {

    public static void main(String[] args) {
        TreeNodePtr root = null;
        IsValidBST(root, Integer.MIN_VALUE, Integer.MIN_VALUE);
    }

    static boolean IsValidBST(TreeNodePtr node, int MIN, int MAX) {
        if (node == null) {
            return true;
        }
        if (node.data > MIN
                && node.data < MAX
                && IsValidBST(node.left, MIN, node.data)
                && IsValidBST(node.right, node.data, MAX)) {
            return true;
        } else {
            return false;
        }
    }
}

Advertisements