My own version of C++ vector, stack, map and set
- Vector (+random_access iterator)
- Stack
- Map (+red-black tree, +bidirectional iterator, +pair)
- Set
- Reverse iterator
https://github.com/nesvoboda/containers-benchmark
https://devdocs.io/cpp/container/map
https://devdocs.io/cpp/container/vector
https://devdocs.io/cpp/container/stack
https://devdocs.io/cpp/container/set
https://devdocs.io/cpp/utility/pair
https://devdocs.io/cpp/types/enable_if
https://devdocs.io/cpp/types/is_integral
https://devdocs.io/cpp/algorithm/lexicographical_compare
https://devdocs.io/cpp/iterator/reverse_iterator
https://www.cs.odu.edu/~zeil/cs361/latest/Public/treetraversal/index.html
https://en.wikipedia.org/wiki/Red–black_tree#Removal_of_a_black_non-root_leaf
https://www.programiz.com/dsa/insertion-in-a-red-black-tree
https://www.programiz.com/dsa/deletion-from-a-red-black-tree