Deque - sellout/data-structure-zoo GitHub Wiki

A deque, short for “Double-Ended QUEue” is an ADT that combines the interfaces of stack and queue, allowing access to either end. It also adds the operations [chop back](/sellout/data-structure-zoo/wiki/chop-back), [peek back](/sellout/data-structure-zoo/wiki/peek-back), and [pop back!](/sellout/data-structure-zoo/wiki/pop-back!).

• doubly linked list
• dynamic array