[prev] [index] [next]

Queues

Insert and delete are called enqueue and dequeue
  • enqueue(Q,V) ... places value V at the tail of Q
  • dequeue(Q) ... remove and return element from head of Q 

Queue q = emptyQueue();

enqueue(q,10); enqueue(q,15); enqueue(q,7);
x = dequeue(q); enqueue(q,12); y = dequeue(q);

// x == 10  &&  y == 15

Example animation