11 lines
362 B
Plaintext
11 lines
362 B
Plaintext
{{Data structure}}
|
|
[[File:Fifo.gif|frame|right|Illustration of FIFO behavior]]
|
|
Create a queue data structure and demonstrate its operations. (For implementations of queues, see the [[FIFO]] task.)
|
|
|
|
Operations:
|
|
* push (aka ''enqueue'') - add element
|
|
* pop (aka ''dequeue'') - pop first element
|
|
* empty - return truth value when empty
|
|
|
|
{{Template:See also lists}}
|