BabelNet

bn:03780427n

Noun Concept

Categories: Abstract data types

double-ended queue deque deques dequeue double ended queue

In computer science, a double-ended queue is an abstract data type that generalizes a queue, for which elements can be added to or removed from either the front or back. Wikipedia

Definitions

Relations

Sources

In computer science, a double-ended queue is an abstract data type that generalizes a queue, for which elements can be added to or removed from either the front or back. Wikipedia

A data type in computer science Wikipedia Disambiguation

Abstract data type for which elements can be added to or removed from either the front or back Wikidata

An abstract list-type data structure where elements can be added to or removed from the front (head) or the back (tail). Wiktionary

IS A

abstract data type

DIFFERENT FROM

double-ended priority queue

Wikipedia

double-ended queue

Wikidata

double-ended queue

Wiktionary

double-ended queue

Wikipedia Redirections

deque, deques, Double-Ended Queue, Double ended queue, Doubly-ended queue, Doubly ended queue, head-tail linked list, real-time deque

Wikidata Alias

deque, dequeue, double ended queue