Recreate C++ containers (vector, map, stack) using C++98 (which means, many stuff are deprecated/deleted by now in the current C++)

0. Copy paste the generic template from vector reference template < class T, class Alloc = allocator<T> > class vector; // generic template (https://www.cplusplus.com/reference/vector/vector/) We will essentially implement one by one the members attributes/functions etc. This of this as your list of TODOs.

1. What the heck is an allocator: In a nutshell: using new, delete is very handy because it automates the construction process of the memory. With Allocator, the 2 process are seperated. You have to allocate memory (using allocate), and then construct it (using construct) which allows to assign a value to the object you allocated.

All STL container use Allocator class for memory allocation. The allocator will be the object holding the data for our STLs: allocator_type _alloc; the main attribute to hold the data structure (beware that allocator_type is just an typedef of Alloc, which in turn, is the class class Alloc = std::allocator<T>).

Some example here: https://www.geeksforgeeks.org/stdallocator-in-cpp-with-examples/ To check functions/return types etc: https://en.cppreference.com/w/cpp/named_req/Allocator

2. Implement member functions: All function templates are given, so it's quite straitforward. Just be careful with the order in which you implement the functions, because some of them depend on other member functions. (e.g. resize)

• First need to finish the base_iterator (random_iterator in our implementation).
• Using the base_iterator, you can instantiate the reverse_iterator
• All the TODOs of reverse_iterator [https://www.cplusplus.com/reference/iterator/reverse_iterator]
• Notes:
  • construtor of rev_iter have an offset of -1, when compared with base_iterator.This means you have to shift the iterator by 1 in the constructor.
  • When calling base, you return the base_iterator. More importantly, you return the iterator + 1 to take into account the offset.

• Main reference for the 3 containers to implement: [https://www.cplusplus.com/], [https://en.cppreference.com/w/]
• The bible of custom iterator: "Writing a custom iterator in modern C++" [https://internalpointers.com/post/writing-custom-iterators-modern-cpp]
• friend function: [https://www.section.io/engineering-education/introduction-to-friend-functions-in-c++/#:~:text=A%20friend%20function%20is%20a,of%20its%20members%20are%20friends]
• Data Structure for Map. Fantastic course: [https://www.coursera.org/lecture/algorithms-part1/red-black-bsts-GZe13]
• Implementation of a Read-Black Tree(RBTree): [https://github.com/Bibeknam/algorithmtutorprograms/blob/master/data-structures/red-black-trees/RedBlackTree.cpp]
• Traversing Trees with Iterators: [https://www.cs.odu.edu/~zeil/cs361/latest/Public/treetraversal/index.html]