package traverse;

public class Main {
	
	public static void main(String[] args) {
	
		BTree<String> sample =
			new BTree<String>(
				new BNode<String>("A",
					new BNode<String>("B",
						new BNode<String>("D"),
						new BNode<String>("E", null, 
							new BNode<String>("H", 
								new BNode<String>("J"),
								null))),
					new BNode<String>("C",
						new BNode<String>("F"),
						new BNode<String>("G", null, 
							new BNode<String>("I")))));

		System.out.println("");
		System.out.println("A sample binary tree");
		System.out.println("--------------------");
		System.out.println("");

		System.out.print("* printed using a stack-based traversal:\n\n\t");
			sample.print(new StackAsStruc<BNode<String>>());
		System.out.println("\n");
		
		
		System.out.print("* printed using a queue-based traversal:\n\n\t");
			sample.print(new QueueAsStruc<BNode<String>>());
		System.out.println("\n");
						
	}
	
}