You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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
The text was updated successfully, but these errors were encountered: