Subversion Repositories programming

Rev

Rev 42 | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 42 Rev 43
Line 6... Line 6...
6 
 
 6 
 
7 
    public static void main ( String [] args ) throws Exception {
 7 
    public static void main ( String [] args ) throws Exception {
8
8
9 
        //this should make a pole if the tree is not balanced
 9 
        //this should make a pole if the tree is not balanced
10 
        //if the tree is _not_ balanced, this will print height = 7
 10 
        //if the tree is _not_ balanced, this will print height = 7
11 
        AVLTree poleTree = new AVLTree(1);
 11 
        AVLTree poleTree = new AVLTree(1,new Integer(1));
12 
        poleTree.add(2);
 12 
        poleTree.add(2,new Integer(2));
13 
        poleTree.add(3);
 13 
        poleTree.add(3,new Integer(3));
14 
        poleTree.add(4);
 14 
        poleTree.add(4,new Integer(4));
15 
        poleTree.add(5);
 15 
        poleTree.add(5,new Integer(5));
16 
        poleTree.add(6);
 16 
        poleTree.add(6,new Integer(6));
17 
        poleTree.add(7);
 17 
        poleTree.add(7,new Integer(7));
18 
 
 18 
 
19 
        System.out.println("poleTree.getHeight() = " + poleTree.getHeight());
 19 
        System.out.println("poleTree.getHeight() = " + poleTree.getHeight());
20 
 
 20 
 
21 
        //this should do something similar to the above test, but
 21 
        //this should do something similar to the above test, but
22 
        //it will use the alternate constructor
 22 
        //it will use the alternate constructor
23 
        int[] nums = { 10,20,30,40,50,60,70 }; //some numbers
 23 
        int[] nums = { 10,20,30,40,50,60,70 }; //some numbers
- 
 
 24 
        Integer[] data = makeIntegers(nums);
- 
 
 25
24 
        poleTree = new AVLTree(nums);
 26 
        poleTree = new AVLTree(nums,data);
25 
        System.out.println("poleTree.getHeight() = " + poleTree.getHeight());
 27 
        System.out.println("poleTree.getHeight() = " + poleTree.getHeight());
26 
 
 28 
 
27 
        System.out.println();
 29 
        System.out.println();
28 
        System.out.println("poleTree.getRoot() = " + poleTree.getRoot());
 30 
        System.out.println("poleTree.getRoot() = " + poleTree.getRoot());
29 
        System.out.println("poleTree.getLeft() = " + poleTree.getLeft());
 31 
        System.out.println("poleTree.getLeft() = " + poleTree.getLeft());
Line 37... Line 39...
37 
        System.out.println("poleTree.get(60) = " + poleTree.get(60));
 39 
        System.out.println("poleTree.get(60) = " + poleTree.get(60));
38 
        System.out.println("poleTree.get(90) = " + poleTree.get(90));
 40 
        System.out.println("poleTree.get(90) = " + poleTree.get(90));
39 
 
 41 
 
40 
        System.out.println();
 42 
        System.out.println();
41 
        int[] nums2 = { 10,20,30,40,50,60,70 };
 43 
        int[] nums2 = { 10,20,30,40,50,60,70 };
- 
 
 44 
        Integer[] data2 = makeIntegers(nums2);
- 
 
 45
42 
        int[] nums3 = { 1,10,2,20,3,30,4,40,5,50 };
 46 
        int[] nums3 = { 1,10,2,20,3,30,4,40,5,50 };
- 
 
 47 
        Integer[] data3 = makeIntegers(nums3);
- 
 
 48
43 
        AVLTree eqlTree = new AVLTree(nums2);
 49 
        AVLTree eqlTree = new AVLTree(nums2,data2);
44 
        AVLTree nonEqlTree = new AVLTree(nums3);
 50 
        AVLTree nonEqlTree = new AVLTree(nums3,data3);
45 
 
 51 
 
46 
        System.out.println("poleTree = " + poleTree);
 52 
        System.out.println("poleTree = " + poleTree);
47 
        System.out.println("eqlTree = " + eqlTree);
 53 
        System.out.println("eqlTree = " + eqlTree);
48 
        System.out.println("nonEqlTree = " + nonEqlTree);
 54 
        System.out.println("nonEqlTree = " + nonEqlTree);
49 
        System.out.println("poleTree.equals(eqlTree) = " + poleTree.equals(eqlTree));
 55 
        System.out.println("poleTree.equals(eqlTree) = " + poleTree.equals(eqlTree));
50 
        System.out.println("poleTree.equals(nonEqlTree) = " + poleTree.equals(nonEqlTree));
 56 
        System.out.println("poleTree.equals(nonEqlTree) = " + poleTree.equals(nonEqlTree));
51 
 
 57 
        /*
52 
        //put remove() test here
 58 
        System.out.println();
- 
 
 59 
        System.out.println("poleTree = " + poleTree);
- 
 
 60 
        System.out.println("poleTree.remove(10) = " + poleTree.remove(10) + "\n" + poleTree);
- 
 
 61 
        System.out.println("poleTree.remove(20) = " + poleTree.remove(20));
- 
 
 62 
        System.out.println("poleTree.remove(90) = " + poleTree.remove(90));
- 
 
 63 
        System.out.println("poleTree = " + poleTree);
53
64 
        */
54 
    }
 65 
    }
- 
 
 66
- 
 
 67 
    //creates an array of Integers from an array of ints. The returned array
- 
 
 68 
    //will have all of the values multiplied by 200 (just to give my data
- 
 
 69 
    //different values from the keys
- 
 
 70 
    public static Integer[] makeIntegers( int[] a ) {
- 
 
 71 
        Integer[] answer = new Integer[a.length];
- 
 
 72 
        for( int i=0; i<a.length; i++ ) {
- 
 
 73 
            answer[i] = new Integer(a[i]*200);
- 
 
 74 
        }
55 
 
 75 
 
- 
 
 76 
        return answer;
- 
 
 77 
    }
- 
 
 78
56 
}
 79 
}
57 
 
 80