Jump to content

Binary tree traversals


Nuv

Recommended Posts

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
    }
}

Link to comment
Share on other sites

This thread is more than a year old. Please don't revive it unless you have something important to add.

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

Guest
Reply to this topic...

×   Pasted as rich text.   Restore formatting

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.

×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.