A doubly linked queue is another form of doubly linked list that allows for adding and removing elements, like a stack. However, unlike a stack, where elements are added and removed from the top of the stack, in a queue elements are added to the top of the queue, and removed from the bottom.

Here is what the pseudocode for creating a basic doubly linked queue would look like:

struct/class Obj:
    Data Obj will contain

    prevElement pointer to previous Obj in queue
    nextElement pointer to next Obj in queue

struct Queue:
    firstElement pointer to bottom of queue
    lastElement pointer to top of queue