Subversion Repositories programming

        //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);

        poleTree.add(2);

        poleTree.add(3);

        poleTree.add(4);

        poleTree.add(5);

        poleTree.add(6);

        poleTree.add(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

        poleTree = new AVLTree(nums);

        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 };

        int[] nums3 = { 1,10,2,20,3,30,4,40,5,50 };

        AVLTree eqlTree = new AVLTree(nums2);

        AVLTree nonEqlTree = new AVLTree(nums3);

        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));

        //put remove() test here