An STL-compatible container for Binary Search Tree that implements various tree traversal methods in-, pre-, post-order through an iterator.
The container is a template parameterized by the type of stored objects, the comparison operator and the allocator, as well as meets the following requirements for stl-compatible containers:
The tree traversal method is implemented through an iterator, and the "++" operator should move the iterator to the next element in the tree, according to the traversal rule.
- STL-compatible, so std:: methods like find, sort, etc. are working with my container
- Used Tag Dispatch Idiom
- Without extra memory space