IntroductionSequence Containers refer to a group of container class templates that implement storage of data elements. The elements are arranged in a strict linear order and it supports insertion and removal of elements.
A random access dynamic container
A sequence that supports both forward and backward traversal and insertion of elements to the front or back of the list in constant time
A deque is a container class template that implements a double-ended queue.
A bit_vector is more like a vector < bool >
An slist is a singly linked list