Subversion Repositories programming

Rev

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

Rev 36 Rev 37
Line 6... Line 6...
6 
class Driver {
 6 
class Driver {
7 
    public static void main ( String [] args ) throws Exception {
 7 
    public static void main ( String [] args ) throws Exception {
8 
        BinaryTree tree1 = createTreeOne();
 8 
        BinaryTree tree1 = createTreeOne();
9 
        BinaryTree tree2 = createTreeTwo();
 9 
        BinaryTree tree2 = createTreeTwo();
10 
        BinaryTree tree3 = createTreeThree();
 10 
        BinaryTree tree3 = createTreeThree();
- 
 
 11 
        BinaryTree tree4 = createTreeOne();
- 
 
 12 
        BinaryTree tree5 = createTreeThree(); //make a copy for later
11
13
- 
 
 14 
        // ---- check getter methods ----
12 
        System.out.println("Testing getter methods...");
 15 
        System.out.println("Testing getter methods...");
13 
        System.out.println("root: " + tree3.getRoot());
 16 
        System.out.println("root: " + tree3.getRoot());
14 
        System.out.println("left: " + tree3.getLeft());
 17 
        System.out.println("left: " + tree3.getLeft());
15 
        System.out.println("right: " + tree3.getRight());
 18 
        System.out.println("right: " + tree3.getRight());
- 
 
 19 
        System.out.println();
16 
 
 20 
 
- 
 
 21 
        // ---- check setter and toString methods ----
17 
        System.out.println("Testing setter and toString methods...");
 22 
        System.out.println("Testing setter and toString methods...");
18 
        tree1.setRoot("A");
 23 
        tree4.setRoot("A");
19 
        tree1.setLeft( new BinaryTree("B"));
 24 
        tree4.setLeft( new BinaryTree("B"));
20 
        tree1.setRight( new BinaryTree("C"));
 25 
        tree4.setRight( new BinaryTree("C"));
21 
        System.out.println("tree1: " + tree1 ); //should print ((A),B,(C))
 26 
        System.out.println("tree4: " + tree4 ); //should print ((A),B,(C))
- 
 
 27 
        System.out.println();
22 
 
 28
- 
 
 29 
        // ---- check misc methods ----
23 
        System.out.println("Testing misc methods...");
 30 
        System.out.println("Testing misc methods...");
24 
        System.out.println("tree1.isLeaf(): " + tree1.isLeaf());
 31 
        System.out.println("tree4.isLeaf(): " + tree4.isLeaf());
25 
        System.out.println("tree1.left.isLeaf(): " + tree1.getLeft().isLeaf());
 32 
        System.out.println("tree4.left.isLeaf(): " + tree4.getLeft().isLeaf());
- 
 
 33 
        System.out.println();
26 
        //
 34
27 
        System.out.println("tree3.size(): " + tree3.size());
 35 
        System.out.println("tree3.size(): " + tree3.size());
- 
 
 36 
        System.out.println();
- 
 
 37
28 
        System.out.println("tree3.height(): " + tree3.height());
 38 
        System.out.println("tree3.height(): " + tree3.height());
- 
 
 39 
        System.out.println();
- 
 
 40
29 
        System.out.println("tree3.contains(\"2\"): " + tree3.contains("2"));
 41 
        System.out.println("tree3.contains(\"2\"): " + tree3.contains("2"));
30 
        System.out.println("tree3.contains(\"zZ\"): " + tree3.contains("zZ"));
 42 
        System.out.println("tree3.contains(\"zZ\"): " + tree3.contains("zZ"));
- 
 
 43 
        System.out.println();
- 
 
 44
- 
 
 45 
        System.out.println("tree3.numLeaves(): " + tree3.numLeaves());
- 
 
 46 
        System.out.println("tree1.numLeaves(): " + tree1.numLeaves());
- 
 
 47 
        System.out.println();
- 
 
 48
- 
 
 49 
        System.out.println("tree3.count(\"s\"): " + tree3.count("s"));
- 
 
 50 
        System.out.println("tree3.count(\"zZ\"): " + tree3.count("zZ"));
- 
 
 51 
        System.out.println();
- 
 
 52
- 
 
 53 
        System.out.println("tree3.isFull(): " + tree3.isFull());
- 
 
 54 
        System.out.println("tree4.isFull(): " + tree4.isFull());
- 
 
 55 
        System.out.println();
- 
 
 56
- 
 
 57 
        System.out.println("tree3.isBalanced(): " + tree3.isBalanced());
- 
 
 58 
        System.out.println("tree4.isBalanced(): " + tree4.isBalanced());
- 
 
 59 
        System.out.println();
- 
 
 60
- 
 
 61 
        System.out.println("tree3.pathLength(): " + tree3.pathLength());
- 
 
 62 
        System.out.println("tree4.pathLength(): " + tree4.pathLength());
- 
 
 63 
        System.out.println();
- 
 
 64
- 
 
 65 
        System.out.println("tree4 = " + tree4);
- 
 
 66 
        System.out.println("tree4.reverse() = " + tree4.reverse());
- 
 
 67 
        System.out.println("tree2 = " + tree2);
- 
 
 68 
        System.out.println("tree2.reverse() = " + tree2.reverse());
- 
 
 69 
        System.out.println();
- 
 
 70 
 
- 
 
 71 
        System.out.println("tree1.level(\"H\"): " + tree1.level("H"));
- 
 
 72 
        System.out.println("tree2.level(\"O\"): " + tree2.level("O"));
- 
 
 73 
        System.out.println();
- 
 
 74 
 
- 
 
 75 
        System.out.println("tree4.isDisjointFrom(tree1): "
- 
 
 76 
            + tree4.isDisjointFrom(tree1));
- 
 
 77 
        System.out.println("tree3.isDisjointFrom(new BinaryTree(\"s\"): "
- 
 
 78 
            + tree3.isDisjointFrom(new BinaryTree("s")));
- 
 
 79 
        System.out.println();
- 
 
 80 
 
- 
 
 81 
        System.out.println("tree1.isValid(): " + tree1.isValid());
- 
 
 82 
        System.out.println("tree2.isValid(): " + tree2.isValid());
- 
 
 83 
        System.out.println("tree3.isValid(): " + tree3.isValid());
- 
 
 84 
        System.out.println();
- 
 
 85 
 
- 
 
 86 
        System.out.println("tree1.equals(tree3): " + tree1.equals(tree3));
- 
 
 87 
        System.out.println("tree3.equals(tree5): " + tree3.equals(tree5));
- 
 
 88 
        System.out.println();
- 
 
 89
- 
 
 90 
        // ---- check print methods ----
- 
 
 91 
        System.out.println("Testing Printing Methods...");
- 
 
 92 
 
- 
 
 93 
        // for tree1
- 
 
 94 
        System.out.print("BinaryTree.preOrderPrint(tree1): ");
- 
 
 95 
            BinaryTree.preOrderPrint(tree1); System.out.println();
- 
 
 96 
        System.out.print("BinaryTree.inOrderPrint(tree1): ");
- 
 
 97 
            BinaryTree.inOrderPrint(tree1); System.out.println();
- 
 
 98 
        System.out.print("BinaryTree.postOrderPrint(tree1): ");
- 
 
 99 
            BinaryTree.postOrderPrint(tree1); System.out.println();
- 
 
 100 
        System.out.print("BinaryTree.levelOrderPrint(tree1): ");
- 
 
 101 
            BinaryTree.levelOrderPrint(tree1); System.out.println();
- 
 
 102 
        System.out.println();
31
103
- 
 
 104 
        //for tree2
- 
 
 105 
        System.out.print("BinaryTree.preOrderPrint(tree2): ");
- 
 
 106 
            BinaryTree.preOrderPrint(tree2); System.out.println();
- 
 
 107 
        System.out.print("BinaryTree.inOrderPrint(tree2): ");
- 
 
 108 
            BinaryTree.inOrderPrint(tree2); System.out.println();
- 
 
 109 
        System.out.print("BinaryTree.postOrderPrint(tree2): ");
- 
 
 110 
            BinaryTree.postOrderPrint(tree2); System.out.println();
- 
 
 111 
        System.out.print("BinaryTree.levelOrderPrint(tree2): ");
- 
 
 112 
            BinaryTree.levelOrderPrint(tree2); System.out.println();
- 
 
 113 
        System.out.println();
32
114
- 
 
 115 
        //for tree3
- 
 
 116 
        System.out.print("BinaryTree.preOrderPrint(tree3): ");
- 
 
 117 
            BinaryTree.preOrderPrint(tree3); System.out.println();
- 
 
 118 
        System.out.print("BinaryTree.inOrderPrint(tree3): ");
- 
 
 119 
            BinaryTree.inOrderPrint(tree3); System.out.println();
- 
 
 120 
        System.out.print("BinaryTree.postOrderPrint(tree3): ");
- 
 
 121 
            BinaryTree.postOrderPrint(tree3); System.out.println();
- 
 
 122 
        System.out.print("BinaryTree.levelOrderPrint(tree3): ");
- 
 
 123 
            BinaryTree.levelOrderPrint(tree3); System.out.println();
- 
 
 124 
        System.out.println();
33 
    }
 125 
    }
34
126
35 
    public static BinaryTree createTreeOne() {
 127 
    public static BinaryTree createTreeOne() {
36 
        return new BinaryTree("H");
 128 
        return new BinaryTree("H");
37 
    }
 129 
    }