// CSE 143, Winter 2010, Marty Stepp
//
// This client program creates a tree set of integers and prints its elements.
// It also searches the tree for various values.
// You can see a nice visualization of binary trees in jGRASP's debugger.
//
// Today's version tests the getMin and remove methods.

public class TreeMain {
    public static void main(String[] args) {
        // construct a tree by adding nodes to it
        SearchTree tree = new SearchTree();
        tree.add(55);
        tree.add(29);
        tree.add(87);
        tree.add(-3);
        tree.add(42);
        tree.add(60);
        tree.add(91);
        
        // print all values in the tree
        tree.print();
        
        // search the tree for various values
        System.out.println(tree.contains(29));   // true
        System.out.println(tree.contains(55));   // true
        System.out.println(tree.contains(63));   // false
        System.out.println(tree.contains(35));   // false
        System.out.println("min = " + tree.getMin());
        System.out.println();
        
        tree.remove(87);
        tree.print();
        
        tree.remove(-3);
        tree.print();
        tree.remove(91);
        tree.print();
        tree.remove(55);
        tree.print();
        tree.remove(42);
        tree.print();
        tree.remove(29);
        tree.print();
        tree.remove(60);
        tree.print();
    }
}