[fongmingyun]

Ugh, I've been having a decent bit of trouble with this. Does anyone have an algorithm for returning the next node in a tree using preorder traversal? Do I need to to use a stack structure?

(Btw, coding a scene graph structure in C++ if you're curious.)

[Shaderhacker]

Originally Posted by fongmingyun

Ugh, I've been having a decent bit of trouble with this. Does anyone have an algorithm for returning the next node in a tree using preorder traversal?

What kind of tree? Binary? Red/Black? Arbitrary?

[fongmingyun]

Arbitrary. Any number of children, basically.

I finished this assignment awhile ago - I ended up writing something relatively complicated that goes "down" or "up and then right" recursively. I wonder if there's a more efficient method.

[geckzilla]

Reminds me of a function I wrote in php once to traverse directory structures. What I ended up doing was having the function call itself within itself whenever it hit a directory. This is super simplified way of describing what I did:

function traverseNode(node) {
  for(x in node) {
    //do whatever with x here

    //then see if it has children
    if(x.children > 0) {
      traverseNode(x);
    }
  }
}

Though I don't really have any context. You mentioned going right, up, and down so maybe I'm completely misunderstanding what this is.