Binary tree traversals

[Nuv]

I am trying to display binary tree  level wise. Breadth-first tree traversal can be used in it.Can anyone point me towards its logic or point me towards a good tutorial.

[requinix]

Breadth-first means looking at children before looking at grandchildren.

 

One simple way to do it is with a queue.

queue = array(root node)
while the queue is not empty { // not a foreach!
    node = the first item in the queue
    display the node
    for each child node {
        add the child node to the end of the queue
    }
}