Subversion Repositories programming

// Written by Ira Snyder
//
import java.io.*;

class Driver {

    public static void main ( String [] args ) throws Exception {
        
        //this should make a pole if the tree is not balanced
        //if the tree is _not_ balanced, this will print height = 7
        AVLTree poleTree = new AVLTree(1,new Integer(1));
        poleTree.add(2,new Integer(2));
        poleTree.add(3,new Integer(3));
        poleTree.add(4,new Integer(4));
        poleTree.add(5,new Integer(5));
        poleTree.add(6,new Integer(6));
        poleTree.add(7,new Integer(7));

        System.out.println("poleTree.getHeight() = " + poleTree.getHeight());

        //this should do something similar to the above test, but
        //it will use the alternate constructor
        int[] nums = { 10,20,30,40,50,60,70 }; //some numbers
        Integer[] data = makeIntegers(nums);
        
        poleTree = new AVLTree(nums,data);
        System.out.println("poleTree.getHeight() = " + poleTree.getHeight());

        System.out.println();
        System.out.println("poleTree.getRoot() = " + poleTree.getRoot());
        System.out.println("poleTree.getLeft() = " + poleTree.getLeft());
        System.out.println("poleTree.getRight() = " + poleTree.getRight());
        
        System.out.println();
        System.out.println("poleTree.contains(70) = " + poleTree.contains(70));
        System.out.println("poleTree.contains(90) = " + poleTree.contains(90));

        System.out.println();
        System.out.println("poleTree.get(60) = " + poleTree.get(60));
        System.out.println("poleTree.get(90) = " + poleTree.get(90));

        System.out.println();
        int[] nums2 = { 10,20,30,40,50,60,70 };
        Integer[] data2 = makeIntegers(nums2);
        
        int[] nums3 = { 1,10,2,20,3,30,4,40,5,50 };
        Integer[] data3 = makeIntegers(nums3);
        
        AVLTree eqlTree = new AVLTree(nums2,data2);
        AVLTree nonEqlTree = new AVLTree(nums3,data3);

        System.out.println("poleTree = " + poleTree);
        System.out.println("eqlTree = " + eqlTree);
        System.out.println("nonEqlTree = " + nonEqlTree);
        System.out.println("poleTree.equals(eqlTree) = " + poleTree.equals(eqlTree));
        System.out.println("poleTree.equals(nonEqlTree) = " + poleTree.equals(nonEqlTree));
        /*
        System.out.println();
        System.out.println("poleTree = " + poleTree);
        System.out.println("poleTree.remove(10) = " + poleTree.remove(10) + "\n" + poleTree);
        System.out.println("poleTree.remove(20) = " + poleTree.remove(20));
        System.out.println("poleTree.remove(90) = " + poleTree.remove(90));
        System.out.println("poleTree = " + poleTree);
        */
    }
    
    //creates an array of Integers from an array of ints. The returned array
    //will have all of the values multiplied by 200 (just to give my data
    //different values from the keys
    public static Integer[] makeIntegers( int[] a ) {
        Integer[] answer = new Integer[a.length];
        for( int i=0; i<a.length; i++ ) {
            answer[i] = new Integer(a[i]*200);
        }

        return answer;
    }
    
}