/*
 * SearchTreeExample.java
 *
 */



public class SearchTreeExample {
    
    /** Creates a new instance of SearchTreeExample */
    public static void main(String[] args) {
        
        int[]  a = {10, 7, 9,  4, 2, 17, 18, 1, 20, 3, 5, 14, 15, 6, 16, 12, 8, 19, 11, 13, };
        MyComparator c = new MyComparator();
        BinarySearchTree  t = new BinarySearchTree(c);
        
        // generate a tree t, each number in array int[] a is a node in the tree.
        for (int i=0; i < a.length; i++)
            t.insert(a[i], a[i]);
        t.printTree();        
    }
}