Skip to content

Glossary: Data Structures and Algorithms in JavaScript

Deque

Also written: double-ended queue

A double-ended queue: a list you can add to and remove from at both ends. JavaScript has no built-in one, and a queue built from linked nodes with a head and a tail gives O(1) adds and removals without the slow `shift` of an array.

Where the book teaches it

Related terms

QueueLinked list