Subversion Repositories programming

Rev

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

Rev 33 Rev 34
Line 12... Line 12...
12 
        System.out.println( test_12_5() );
 12 
        System.out.println( test_12_5() );
13 
        System.out.println( test_12_6() );
 13 
        System.out.println( test_12_6() );
14 
        System.out.println( test_12_7() );
 14 
        System.out.println( test_12_7() );
15 
        System.out.println( test_12_8() );
 15 
        System.out.println( test_12_8() );
16 
        System.out.println( test_12_9() );
 16 
        System.out.println( test_12_9() );
- 
 
 17 
        System.out.println( test_12_10());
- 
 
 18 
        //System.out.println( test_12_11());
- 
 
 19
- 
 
 20 
        BinaryTree treeA = createTestTree();
- 
 
 21 
        //System.out.println("level E: " + treeA.level("E"));
- 
 
 22 
        //System.out.println("treeA == treeB: " +
- 
 
 23 
        //    treeA.equals( new BinaryTree("Q",createTestTree(),createTestTree())));
17 
 
 24
- 
 
 25 
        System.out.print("PreOrder: "); BinaryTree.preOrderPrint(treeA);
- 
 
 26 
        System.out.println();
- 
 
 27
- 
 
 28 
        System.out.print("PostOrder: "); BinaryTree.postOrderPrint(treeA);
- 
 
 29 
        System.out.println();
- 
 
 30
- 
 
 31 
        System.out.print("LevelOrder: "); BinaryTree.levelOrderPrint(treeA);
- 
 
 32 
        System.out.println();
- 
 
 33
- 
 
 34 
        System.out.print("InOrder: "); BinaryTree.inOrderPrint(treeA);
- 
 
 35 
        System.out.println();
- 
 
 36
- 
 
 37
18 
    } //end main
 38 
    } //end main
19 
 
 39 
 
20 
    public static BinaryTree createTestTree() {
 40 
    public static BinaryTree createTestTree() {
21 
        BinaryTree treeB = new BinaryTree("B");
 41 
        BinaryTree treeB = new BinaryTree("B");
22 
        BinaryTree treeD = new BinaryTree("D");
 42 
        BinaryTree treeD = new BinaryTree("D");
Line 109... Line 129...
109 
 
 129 
 
110 
        if( treeA.isFull() == false ) { return "test_12_9: PASSED"; }
 130 
        if( treeA.isFull() == false ) { return "test_12_9: PASSED"; }
111 
        return "test_12_9: *** FAILED ***";
 131 
        return "test_12_9: *** FAILED ***";
112 
    }
 132 
    }
113 
 
 133 
 
- 
 
 134 
    public static String test_12_10() {
- 
 
 135 
        BinaryTree treeA = createTestTree();
- 
 
 136 
 
- 
 
 137 
        if( treeA.isBalanced() == true ) { return "test_12_10: PASSED"; }
- 
 
 138 
        return "test_12_10: *** FAILED ***";
- 
 
 139 
    }
- 
 
 140 
 
- 
 
 141 
    //public static String test_12_11() {
- 
 
 142 
    //    BinaryTree treeA = createTestTree();
- 
 
 143 
    //
- 
 
 144 
    //    if( treeA.pathLength() == 6 ) { return "test_12_11: PASSED"; }
- 
 
 145 
    //    return "test_12_11: *** FAILED *** val:" + treeA.pathLength();
- 
 
 146 
    //}
- 
 
 147 
 
114 
} //end class Driver
 148 
} //end class Driver
115 
 
 149 
 
116 
/*
 150 
/*
117 
      BufferedReader kb = new BufferedReader(
 151 
      BufferedReader kb = new BufferedReader(
118 
                              new InputStreamReader(System.in));
 152 
                              new InputStreamReader(System.in));