Deque: Difference between revisions
Jump to navigation
Jump to search
| Line 9: | Line 9: | ||
=Overview= | =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. The [[Data Structures#INSERT|INSERT]] and [[Data Structures#DELETE|DELETE]] operations | 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. The [[Data Structures#INSERT|INSERT]] and [[Data Structures#DELETE|DELETE]] operations have each two versions: | ||
* insert to head or push. | |||
* delete from head or pop. | |||
* insert to tail or inject. | |||
* delete from tail or eject, | |||
Revision as of 20:25, 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. The INSERT and DELETE operations have each two versions:
- insert to head or push.
- delete from head or pop.
- insert to tail or inject.
- delete from tail or eject,