Binary tree

[cis]

I have a project to do that requires me to print out a Binary tree i have got it to print the three orders ( inorder, preorder, and postorder ) which is really easy to do but now I got to print out the actual tree itself. I have no clue where to start and i was woundering if someone could help me.

Example output:
---------------------------------------------
d
/ \
b f
/ \ / \
a c e g
----------------------------------------------
(or)
----------------------------------------------
g
f
e
d
c
b
a

[cis]

the second tree was suppose to be the same as the first but it just printed to the left side

I should of used preview

Anyway can someone give me some help

[Prelude]

void printnode ( char c, int h )
{
  int i;
  for ( i = 0; i < h; i++ )
    printf ( " " );
  printf ( "%c\n", c );
}

void show ( struct node x, int h )
{
  if ( x == NULL ) {
    printnode ( '*', h );
    return;
  }
  show ( x->r, h + 1 );
  printnode ( x->item, h );
  show ( x->l, h + 1 );
}

-Prelude

[Nick]

Do a level order traversal by using a queue.