Deque: Difference between revisions

From NovaOrdis Knowledge Base
Jump to navigation Jump to search
No edit summary
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.
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

Revision as of 20:23, 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