Queue: Difference between revisions
Jump to navigation
Jump to search
(Created page with "=Internal= * Data Structures =Overview= Difference between list and queue.") |
|||
| Line 5: | Line 5: | ||
=Overview= | =Overview= | ||
Difference between list and queue. | =Overview= | ||
A '''queue''' is a [[Data_Structures#Dynamic_Set|dynamic set]] in which the the [[Data Structures#DELETE|DELETE]] operation, which does not have any argument, removes the oldest element. The queue has a ''first-in-first-out'', or FIFO policy. Also see [[Stack#Overview|Stack]]. | |||
<font color=darkgray>Difference between list and queue.</font> | |||
Revision as of 01:14, 11 August 2018
Internal
Overview
Overview
A queue is a dynamic set in which the the DELETE operation, which does not have any argument, removes the oldest element. The queue has a first-in-first-out, or FIFO policy. Also see Stack.
Difference between list and queue.