21 Jun
2011
21 Jun
'11
2:12 a.m.
On Jun 21, 2011 2:15 AM, "Oliver Kowalke" <oliver.kowalke@gmx.de> wrote:
For instance iterating an tree would usally require to traverse the complete tree and store the nodes in a STL container - the begin/end iterators of this STL container are used to iterate the tree.
I'm under the impression that we generally iterate through trees by pointing the iterator to the node of the tree, instead of storing everything into a stack. I would probably have to do this if the tree was an object shared across several threads. Is this meant for this type of usage? Cheers, Sylvain