The current Tree<T> is flawed concering const-correctness, and the user cannot choose whether iteration should happen depth or breadth first. STL iterators could be the right solution here. Also an iterator over the leaves only would be helpful in many situations, or iterators over certain classes of nodes...
The current
Tree<T>is flawed concering const-correctness, and the user cannot choose whether iteration should happen depth or breadth first. STL iterators could be the right solution here. Also an iterator over the leaves only would be helpful in many situations, or iterators over certain classes of nodes...See also #18