class Umgebung{
    public static void main(String[] a){
        SearchTree<String> t = new SearchTree<String>("Muenchen");
        System.out.println(t);
        t.insert("Trier"); System.out.println(t);
        t.insert("Koeln"); System.out.println(t);
        t.insert("Berlin"); System.out.println(t);
        t.insert("Hamburg"); System.out.println(t);
        t.insert("Osnabrueck"); System.out.println(t);
        t.insert("Stuttgart"); System.out.println(t);
        System.out.println("Min in t: "+t.min()); 
        System.out.println("Max in t: "+t.max()); 
        SearchTree<String> t1 = t.search("Berlin"); 
        System.out.println("Berlin tree = "+t1);
        SearchTree<String> t2 = t.search("Bremen"); 
        System.out.println("Bremen tree = "+t2);

        System.out.println(t2.min(null,"Alfa"));
        System.out.println(t2.min("Alfa",null));


        SearchTree<Integer> t5;
        for(int i=10;i<1000;i=i+10){
            t5 = SearchTree.random(i);
/* Uncommenting this raises an AssertionError if assertions are enabled
            assert (i<100 || t5.isBalanced()) : 
                           "Random tree with "+i+" elements is not balanced";
*/

        }
    }
}