Daily bit(e) of C++ #18, The algorithms worth knowing: tree traversal
Never thought,that traversal can be differs from 1st variant ( parent, child, child). Great article. It is very helpful.
Excellent article, Simon, very thorough and helpful. Thanks!
Instead of `optional<size_t>`, I'd use `size_t` with `numeric_limits<size_t>::max()` as the null index value, because there can never be that many referencible elements, if this number is the maximum vector size.
Never thought,that traversal can be differs from 1st variant ( parent, child, child). Great article. It is very helpful.
Excellent article, Simon, very thorough and helpful. Thanks!
Instead of `optional<size_t>`, I'd use `size_t` with `numeric_limits<size_t>::max()` as the null index value, because there can never be that many referencible elements, if this number is the maximum vector size.