Subversion Repositories programming

Rev

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

Rev 25 Rev 26
Line 1... Line 1...
1 
// Written by Ira Snyder
 1 
// Written by Ira Snyder
- 
 
 2 
// Project #2
2 
// 11-03-2004
 3 
// Due Date: 11-05-2004
- 
 
 4 
 
3 
import java.io.*;
 5 
import java.io.*;
4 
import java.util.*;
 6 
import java.util.*;
5 
 
 7 
 
6 
class Driver {
 8 
class Driver {
7 
 
 9 
 
8 
	public static void main( String[] args ) throws Exception {
 10 
	public static void main( String[] args ) throws Exception {
9
11
10 
		//create both example trees
 12 
		//create both example trees
11 
		UnorderedTree tree1 = createTreeOne();
 13 
		UnorderedTree tree1 = createTreeOne();
12 
		UnorderedTree tree2 = createTreeTwo();
 14 
		UnorderedTree tree2 = createTreeTwo();
13 
 
 15
- 
 
 16 
        //tree 1
- 
 
 17 
        System.out.println("TreeOne's size is: " + tree1.size());
- 
 
 18 
        System.out.println("Starting TreeOne's Traversals...");
- 
 
 19 
        System.out.print("PreOrder: ");
14 
		tree1.printPreOrder( System.out );
 20 
        tree1.printPreOrder( System.out );
- 
 
 21 
        System.out.print("PostOrder: ");
15 
		tree1.printPostOrder( System.out );
 22 
        tree1.printPostOrder( System.out );
- 
 
 23 
        System.out.print("LevelOrder: ");
16 
		tree1.printLevelOrder( System.out );
 24 
        tree1.printLevelOrder( System.out );
17 
		System.out.println(); //blank line
 25 
        System.out.println(); //blank line
18 
 
 26
- 
 
 27 
        //tree 2
- 
 
 28 
        System.out.println("TreeTwo's size is: " + tree2.size());
- 
 
 29 
        System.out.println("Starting TreeTwo's Traversals...");
- 
 
 30 
        System.out.print("PreOrder: ");
19 
		tree2.printPreOrder( System.out );
 31 
        tree2.printPreOrder( System.out );
- 
 
 32 
        System.out.print("PostOrder: ");
20 
		tree2.printPostOrder( System.out );
 33 
        tree2.printPostOrder( System.out );
- 
 
 34 
        System.out.print("LevelOrder: ");
21 
		tree2.printLevelOrder( System.out );
 35 
        tree2.printLevelOrder( System.out );
22 
	}
 36 
    }
23 
 
 37 
 
24 
	//method to create and return tree 1
 38 
	//method to create and return tree 1
25 
	public static UnorderedTree createTreeOne( ) {
 39 
	public static UnorderedTree createTreeOne( ) {
26
40
27 
		//create all leaf nodes
 41 
		//create all leaf nodes
Line 54... Line 68...
54 
		subtreesOfB.add(treeG);
 68 
		subtreesOfB.add(treeG);
55 
 
 69 
 
56 
		//create treeB
 70 
		//create treeB
57 
		UnorderedTree treeB = new UnorderedTree("B", subtreesOfB);
 71 
		UnorderedTree treeB = new UnorderedTree("B", subtreesOfB);
58 
 
 72 
 
59 
		//--------------------------------//
 - 
 
60 
		// now starting on the right tree //
 - 
 
61 
		//--------------------------------//
 - 
 
62
- 
 
63 
		//create Set of subtrees of treeJ
 73 
		//create Set of subtrees of treeJ
64 
		Set subtreesOfJ = new HashSet();
 74 
		Set subtreesOfJ = new HashSet();
65 
		subtreesOfJ.add(treeK);
 75 
		subtreesOfJ.add(treeK);
66 
		subtreesOfJ.add(treeL);
 76 
		subtreesOfJ.add(treeL);
67 
		subtreesOfJ.add(treeM);
 77 
		subtreesOfJ.add(treeM);