As sbi mentioned, making a left-aligned version is easier than a center-aligned one. But whichever alignment you choose your fundamental algorithmic approach should be:
Traverse the tree breadth-first. Do this by using a queue with the following algorithm:
- Declare a queue
- Add the root node to the queue
- While the queue contains more nodes, do 4 - 6:
- Dequeue a node
- Print the node. After every print
that is one less than a power of 2th time (starting from 1), also
print a newline.
- Enqueue the node's children
(See http://www.cs.bu.edu/teaching/c/tree/breadth-first/ )
In order to print a center-aligned tree, also do the following (only works if the tree is complete. If it's not complete, the easiest thing to do is make a complete copy where every place that should have a node gets some kind of a null node):
- Instead of printing to the screen,
"print" each line into a string in
an array of strings.
- As you go, keep track of the length
in characters of the longest element
you print. Let's call this
maxElemLen.
- Whenever you print an element, print
one tab character before it and one
tab character after it.
- At the very end, go back, and in
every line in the array, replace
each tab character with 2^(nLines -
lineNum) tab characters.
- Then expand each tab that comes
after a tab or newline to
maxElemLen+1 spaces, and expand each
tab that comes after anything else
(i.e., after a printed elem) to (maxElemLen + 1 - (the
number of characters elapsed since
the last tab)) spaces.
- Finally, print each line of your
array, in order.