A deque is a kind of sequence that supports random access iterators. The deque class also supports insert and erase operations at the beginning middle or the end. However, deque is especially optimized for pushing and popping elements at the beginning and end.
A deque satisfies all of the requirements of a container and of a reversible container as well as of a sequence.