{{Data structure}}
[[File:Fifo.gif|frame|right|Illustration of FIFO behavior]]

;Task:
Create a queue data structure and demonstrate its operations.

(For implementations of queues, see the [[FIFO]] task.)


Operations:
::* &nbsp; push   &nbsp; &nbsp; &nbsp;        (aka ''enqueue'') - add element
::* &nbsp; pop    &nbsp; &nbsp; &nbsp; &nbsp; (aka ''dequeue'') - pop first element
::* &nbsp; empty  &nbsp; &nbsp;               - return truth value when empty

<br>
{{Template:See also lists}}
<br><br>
