STL: <list>

• A list manages its elements as a doubly linked list.

• #include <list>

• A list does not provide random access.

• Inserting and removing elements is fast at each position, and not only at one or both ends.

• Inserting and deleting elements does not invalidate pointers, references, and iterators to other elements.