// CSE 143, Winter 2011, Marty Stepp
//
// This client program creates a tree of integers and prints its elements.
// You can see a nice visualization of binary trees in jGRASP's debugger.
//
// Output:
// -3 29 42 55 60 87 91

public class TreeMain {
    public static void main(String[] args) {
        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);
        tree.print();
        
        System.out.println(tree.contains(29));    // true
        System.out.println(tree.contains(60));    // true
        System.out.println(tree.contains(-3));    // true
        System.out.println(tree.contains(444));   // false
        System.out.println(tree.contains(12));    // 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();
    }
}