You get a bonus - 1 coin for daily activity. Now you have 1 coin

Double-Ended Queue (Deque)

Lecture



Double-ended queue (colloq. deque, from English deque — double ended queue; two-sided queue, a queue with two ends) — an abstract data type in which elements can be added and removed both at the beginning and at the end. It can be implemented using a doubly linked list.

Double-Ended Queue (Deque)

Typical operations

  • PushBack — add to the end of the queue.
  • PushFront — add to the front of the queue.
  • PopBack — remove from the end of the queue.
  • PopFront — remove from the front of the queue.
  • IsEmpty — check whether there are any elements.
  • Clear — clear the queue.

Application

A double-ended queue can be used to store browsing history: new websites are added to the end of the queue, and the oldest entries are removed when the history becomes too large. When the user asks to clear the browsing history for the last hour, the most recently added entries are removed.

See also

  • Stack
  • Queue
  • [[b4494]]

See also

created: 2024-08-20
updated: 2026-03-10
105

Was this answer useful?
Choose a quick rating so we can improve the next answer for you.
How satisfied are you?

Comments

To leave a comment

If you have any suggestion, idea, thanks or comment, feel free to write. We really value feedback and are glad to hear your opinion.
To reply

Lectures and tutorial on "Structures and data processing algorithms."

Terms: Structures and data processing algorithms.

Elementary data structures
Balanced Search Trees: Balancing a Binary Search Tree
Search Trees: AVL Tree, Splay Tree, and Treap
Implicit Treap (Treap Indexed by Implicit Key)
Suffix Structures: Suffix Array, Suffix Tree, and NP-Hard Problems
The Concept of a Tuple in Computer Science and Mathematics
Data Type
From data structure to algorithm
Counts. Representation of graphs in computer memory
Binary search tree
Data structures Introduction
Theory of data structures and processing algorithms
1.Data types
2. Static and semi-static data structures
3. Dynamic Data Structures
3. Dynamic data structures
4. Recursive data structures
5. Data Search, Search Algorithms, Algorithm Comparison
Search optimization methods
5.6 Binary search (halving method)
5.8 Inserted search (with inclusion) 5.9 Deleted search
6. Sorting
6.2 Sorting by direct selection
6.3. Sort using direct exchange (bubble sort)
6.4. Improved sorting methods
7. KEY TRANSFORMATION (INSTALLATION)
Workshop on structures and data processing algorithms in computer-a guide to laboratory work Organizational and methodological guidelines
Laboratory work number 1. "Semi-static data structures"
Lab number 2. "LIST OF DATA STRUCTURES"
Laboratory work number 3. "RING LISTS"
Laboratory work No. 4. "MODEL OF MASS SERVICE"
Lab number 5. "BINARY TREES (basic procedures)"
Laboratory work number 6. "SORTING BY DIRECT INCLUSION METHOD"
Binary Search Tree and Tree Traversal - Inorder, Preorder, Postorder implemented in Java
Laboratory work number 6. "SORTING BY DIRECT INCLUSION METHOD"
Laboratory work number 7. "SORTING BY DIRECT SELECTION METHOD"
Laboratory work number 8. "SORTING BY DIRECT EXCHANGE"
Laboratory work number 9. "SORTING BY TREE"
Laboratory work number 10. "RESEARCH OF METHODS OF LINEAR AND BINARY SEARCH"
Laboratory work number 12. "SEARCH BY WOOD WITH INCLUSION"
Laboratory work number 13. "SEARCH BY TREE WITH EXCLUSION"
Laboratory work №11. "RESEARCH OF METHODS OF SEARCH OPTIMIZATION"
TESTS TO LABORATORY WORKS on algorithms and structures
Methodical guide to course work data structures and algorithms
Conclusion Literature tests with answers on the structures of algorithms
1. DATA STRUCTURES AND ALGORITHMS
2. SIMPLE DATA STRUCTURE
3. STATIC DATA STRUCTURE
4. Semi-static data structures
5. DYNAMIC STRUCTURES OF DATA. RELATED LISTS
Queues
Queues on the example of the C language
Cyclic queue on the example of the C language
Stacks on the example of the C language
Related lists for examples in the C language
Singly related lists with C examples
Doubly linked lists Animated examples. Comparing lists and arrays
Mailing List Example
Binary trees on the example of the C language
Sparse assignment arrays, by the example of the C language
Representation of a sparse array as a linked list using the example of the C language
Representation of a sparse array as a binary tree using the example of the C language
Representation of a sparse array as an array of pointers in C
Choosing a method for implementing sparse array in C
Syntax parsing and evaluating expressions
Hash table
Red and black tree
Queues, Stacks, Linked Lists, and Trees
Sparse arrays
Connected lists in C and Pascal + tests + examples of sorting search inserts into lists
Collection and container in programming. Java collections example
Addressing Elements Using Iliffe Vectors
Jagged array
Data types for storing currencies, money in code and in a database. The best?
array of strings in c
2-3 дерево как структура данных
Static RMQ/RSQ (Range Minimum/Sum Query) and LCA (Least Common Ancestor): Reducing LCA to RMQ
Vector as a Data Structure and Its Representation in Memory
Prufer Sequence and Trees
Ways to Store Sets in Data Structures and Memory
Plain Data Structure (Passive Data Structure)
Abstract Data Type (ADT): Stack, Deque, Queue, Heap
Opaque Data Type
6. Abstract Data Types (ADT)
Data Structures Interview Questions
Type Theory, Basic Computational Formalisms, and Semantic Styles
stack
lists
trees
Lookup Table as a Data Structure
Double-Ended Queue (Deque)
Circular (Ring) Buffer
Priority Queue and Concurrent Priority Queue