// BTPrintComplete - print a complete binary tree in "pretty print" form

public class BTPrintComplete {

	public static void main(String[] args) {
		BTNode<Integer> root;

		root = beginningTree();
		/*
		 * root.preorderPrint(); System.out.println(); root.inorderPrint();
		 * System.out.println(); root.postorderPrint(); root.print(0);
		 */
		prettyPrint(root, 50);

	}

	public static BTNode<Integer> beginningTree() {
		BTNode<Integer> root;
		BTNode<Integer> child;

		root = new BTNode<Integer>(1, null, null);
		child = new BTNode<Integer>(2, null, null);
		root.setLeft(child);
		child = new BTNode<Integer>(3, null, null);
		root.setRight(child);

		child = root.getLeft();

		child.setLeft(new BTNode<Integer>(4, null, null));
		child.setRight(new BTNode<Integer>(5, null, null));

		child = child.getLeft();
		child.setLeft(new BTNode<Integer>(8, null, null));
		child.setRight(new BTNode<Integer>(9, null, null));

		child = root.getRight();
		child.setLeft(new BTNode<Integer>(6, null, null));
		child.setRight(new BTNode<Integer>(7, null, null));

		child = root.getLeft().getRight();
		child.setLeft(new BTNode<Integer>(0, null, null));

		return root;
	}


	public static void prettyPrint(BTNode<Integer> t, int n) {
		LinkedQueue<BTNode<Integer>> q = new LinkedQueue<BTNode<Integer>>();
		BTNode<Integer> node;

		int count = 1;

		q.add(t);

		while (!q.isEmpty()) {
			
			printChar(' ', n/2);
			
			// print one level
			for (int i = 0; !q.isEmpty() && i < count; i++) {
				node = q.remove();

				if (node.getLeft() != null)
					q.add(node.getLeft());
				if (node.getRight() != null)
					q.add(node.getRight());

				System.out.print(node.getData());
				printChar(' ', n);
			}
			
			// set up next level
			System.out.println();
			count *= 2;
			
			n = n/2;

		}

	}
	
	public static void printChar(char c, int n) {
		for (int i = 0; i < n; i++) {
			System.out.print(c);
		}
	}
}