A double-ended queue that supports adding and removing elements from both its front and its back in constant time, generalizing both the stack and the queue into one structure.
Facts
Core PrincipleA data structure in which items may be added to or deleted from the head or the tail. 1 Connections
Sources
1. deque, Dictionary of Algorithms and Data Structures, NIST
DefinitionQuote, Definition
A data structure in which items may be added to or deleted from the head or the tail.
Double-ended queue (Wikipedia)
In Group: Linear and Sequence Structures, LeadQuote, In Group: Linear and Sequence Structures, Lead
In computer science, a double-ended queue (abbreviated as deque, DEK), is an abstract data type that serves as a container, with a restricted access to the stored items.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.