Std::list is designed to have very fast insertions and removals anywhere in the container. It achieves this by providing pointer pointer the next and previous items in the list
Continue reading
std::forward_list
Std::forward_list is designed to have very fast insertions and removals anywhere in the container. It does this by giving each element a pointer to the next element.
std::deque
std::deque is a container designed for very fast insertion and removal at both ends of the container.