public class BinaryTreeTest {

    public static void main( String [ ] args ) {

	BinaryTree t0 = new BinaryTree();
	BinaryTree t1 = new BinaryTree("1");
        BinaryTree t2 = new BinaryTree("2");

	t0.merge("O",t1,t2);

	BinaryNode b0 = t0.getRoot();
	BinaryNode b1 = b0.getLeft();
	BinaryNode b2 = b0.getRight();

	BinaryNode b3 = new BinaryNode("3");
	BinaryNode b4 = new BinaryNode("4");
	BinaryNode b5 = new BinaryNode("5");
	BinaryNode b6 = new BinaryNode("6");

	b1.setLeft(b3);
	b1.setRight(b4);

	b2.setLeft(b5);
	b2.setRight(b6);

	/*
	     0
	  1     2
	 3 4   5 6
	
	*/

	System.out.println("Pre Order Traversal:");
	t0.printPreOrder();
	System.out.println("In Order Traversal:");
	t0.printInOrder();
	System.out.println("Post Order Traversal:");
	t0.printPostOrder();

    }
}

/* output:
   Pre Order Traversal:
   O
   1
   3
   4
   2
   5
   6
   In Order Traversal:
   3
   1
   4
   O
   5
   2
   6
   Post Order Traversal:
   3
   4
   1
   5
   6
   2
   O
*/