How to traverse a tree having more than 2 children

[kishore84]

I want to traverse a tree having more than one children. How to do that.

please provide some code snippet or link.

Thanks

[JosAH]

I want to traverse a tree having more than one children. How to do that.

please provide some code snippet or link.

Thanks

Simply stick the pointers to a nodes' children in a vector and recursively traverse
a tree like this:

void travers(Node* node) {
   if (!node) return; // nothing to do
   // do something with this node ...
   // and traverse through the kids 
   for (vector<Node*>::iterator i= node->kids.beg(); i != node->kids.end(); i++)
      traverse(*i);
}
 

kind regards,

Jos