3.11. The Queue Abstract Data Type¶
The queue abstract data type is defined by the following structure and operations. A queue is structured, as described above, as an ordered collection of items which are added at one end, called the “rear,” and removed from the other end, called the “front.” Queues maintain a first-in-first-out (FIFO) ordering property. The standard queue operations are given below.
queue<dataType> queueNamecreates a new queue that is empty. It returns an empty queue.push(item)adds a new item to the rear of the queue. It needs the item and returns nothing.pop()removes the front item from the queue. It needs no parameters. The queue is modified.empty()tests to see whether the queue is empty. It needs no parameters and returns a Boolean value.size()returns the number of items in the queue. It needs no parameters and returns an integer.front()returns the first item in the queue without removing the item.back()returns the last item in the queue without removing the item.
As an example, if we assume that q is a queue that has been created
and is currently empty, then Table 1 shows the
results of a sequence of queue operations. The queue contents are shown
such that the front is on the right. 4 was the first item pushed so it
is the first item returned by dequeue.
Queue Operation |
Queue Contents |
Return Value |
|---|---|---|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|