Double-ended queue
In computer science, a double-ended queue (dequeue, often abbreviated to deque, pronounced deck) is an abstract data type that generalizes a queue, for which elements can be added to or removed from either the front (head) or back (tail). It is also often called a head-tail linked list, though properly this refers to a specific data structure (see below).
Wikipage disambiguates
differentFrom
primaryTopic
Double-ended queue
In computer science, a double-ended queue (dequeue, often abbreviated to deque, pronounced deck) is an abstract data type that generalizes a queue, for which elements can be added to or removed from either the front (head) or back (tail). It is also often called a head-tail linked list, though properly this refers to a specific data structure (see below).
has abstract
Eine Deque (Double-ended queue ...... Pattern-Matching-Algorithmus).
@de
Em ciência da computação, uma ...... ão ultrapasse o limite máximo.
@pt
In computer science, a double- ...... c data structure (see below).
@en
In informatica, una deque (sol ...... ente dalla testa o dalla coda.
@it
Una cola doblemente terminada ...... arse fácilmente con una deque.
@es
Двусвязная очередь (жарг. дэк, ...... ются одновременно FIFO и LIFO.
@ru
両端キュー（りょうたんキュー、英: double-ended ...... ーである。head-tail linked list とも。
@ja
双端队列（deque，全名double-ended queue）是一种具有队列和栈性质的数据结构。双端队列中的元素可以从两端弹出，插入和删除操作限定在队列的两邊进行。
@zh
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
734,510,471
subject
hypernym
type
comment
Eine Deque (Double-ended queue ...... ementes, ohne es zu entfernen.
@de
Em ciência da computação, uma ...... ue implementado por arranjo é:
@pt
In computer science, a double- ...... c data structure (see below).
@en
In informatica, una deque (sol ...... ente dalla testa o dalla coda.
@it
Una cola doblemente terminada ...... arse fácilmente con una deque.
@es
Двусвязная очередь (жарг. дэк, ...... ются одновременно FIFO и LIFO.
@ru
両端キュー（りょうたんキュー、英: double-ended ...... ーである。head-tail linked list とも。
@ja
双端队列（deque，全名double-ended queue）是一种具有队列和栈性质的数据结构。双端队列中的元素可以从两端弹出，插入和删除操作限定在队列的两邊进行。
@zh
label
Cola doblemente terminada
@es
Deque (estruturas de dados)
@pt
Deque
@de
Deque
@it
Double-ended queue
@en
Двухсторонняя очередь
@ru
両端キュー
@ja
双端队列
@zh