PrintTree

gistfile1.java

public void testPrint() {
        Stack s1 = new Stack();
        s1.push(root);
        int emptyLeaf = 32;
        boolean isRowEmpty = false;

        while(isRowEmpty == false) {
            Stack s2 =  new Stack();
            isRowEmpty = true;

            for(int i = 0; i < emptyLeaf; i++)
                System.out.print(' ');

            while(s1.isEmpty() == false) {
                Node temp = s1.pop();

                if(temp != null) {
                    System.out.print(temp.item);
                    s2.push(temp.leftChild);
                    s2.push(temp.rightChild);
                    if(temp.leftChild != null || temp.rightChild != null)
                        isRowEmpty = false;
                } else {
                    System.out.print("--");
                    s2.push(null);
                    s2.push(null);
                }

                for(int i = 0; i < emptyLeaf * 2 - 2; i++)
                    System.out.print(" ");
            }

            System.out.println();
            emptyLeaf /= 2;
            while(s2.isEmpty() == false) {
                s1.push(s2.pop());
            }
        }
    }