stacks queues

Deque

A Deque (Double-Ended Queue) is a linear data structure that allows insertion and removal of elements from both the front and the rear. It generalizes both stacks and queues, supporting LIFO and FIFO operations simultaneously. It is useful when you need efficient operations on both ends of a collection.