Deque

A deque, or double-ended queue is a data structure which unites the properties of a queue and a stack. Like the stack, items can be pushed into the deque; once inserted into the deque the last item pushed in may be extracted from one side (popped, as in a stack), and the first item pushed in may be pulled out of the other side (as in a queue). "Deque" is usually pronounced like "deck".

See also

External links

 

<< PreviousWord BrowserNext >>
december 13
dr. seuss
digital compositing
dandy
dubbing (filmmaking)
delaunay triangulation
defendant
domitius afer
davis
dan simmons
denis auguste affre
dione
denis leary
dextromethorphan
dryope
doctor
donald i of scotland
danse macabre
david abercromby
deconstruction
direct product
dj vu
dionysius thrax
december 29
despina
discrimination
diene
diatessaron
dean r. koontz
drake equation
damascus
dogme 95
diplomatic immunity
ddr sdram
donald duck
don rosa
dziga vertov
deimos
delaware corporation
detroit river
dsungaripterus
david a. huffman
dagome iudex
da