Deque (double-ended queue) allows adding and removing elements from both ends. It supports push_back, push_front, pop_front, and pop_back operations, with random access and indexing capabilities. It is implemented as a block-structured array of segments with dynamic resizing, along with iterator and standard function support