Dequeue

In computer science a dequeue is a data structure that is essentially a double-ended queue. The main difference between a queue and a dequeue is that elements can be added or removed on either end of dequeue whereas elements may only be added at the tail and removed from the head for a queue. A dequeue maintains a slightly modified FIFO structure, doing so using each end as both head and tail. A common implemenation of a dequeue uses a doubly linked list.