ConceptDeque

Double-Ended Queue

An abstract data structure that permits insertion and deletion at both ends. Common contiguous-memory implementations grow from both ends toward the middle.

Timeline (last 90 days)

Oct 15

A contiguous-memory double-ended queue (deque) grows from both ends toward the middle, maintaining one pointer or index at each end, and operations at both ends are O(1).

Unverified50%

All Facts (1)

Unverified

A contiguous-memory double-ended queue (deque) grows from both ends toward the middle, maintaining one pointer or index at each end, and operations at both ends are O(1).

50%

Source Articles

The Double-Headed Stack Allocator: A New Approach to Memory AllocationOct 15