Deque: Difference between revisions
Jump to navigation
Jump to search
(Created page with "=Internal= * Data Structures") |
No edit summary |
||
| Line 1: | Line 1: | ||
=External= | |||
* https://en.wikipedia.org/wiki/Double-ended_queue | |||
=Internal= | =Internal= | ||
* [[Data Structures#Deque|Data Structures]] | * [[Data Structures#Deque|Data Structures]] | ||
=Overview= | |||
A '''deque''' is a dynamic set that generalizes the concept of [[#Queue|queue]]. The elements can be enqueued and dequeued both from the head and the tail of the deque. | |||
Revision as of 20:18, 11 August 2018
External
Internal
Overview
A deque is a dynamic set that generalizes the concept of queue. The elements can be enqueued and dequeued both from the head and the tail of the deque.