Queue: Difference between revisions
Jump to navigation
Jump to search
| Line 7: | Line 7: | ||
=Overview= | =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 | 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 in the queue. The queue implements the ''first-in-first-out'', or FIFO, policy. Also see [[Stack#Overview|Stack]]. | ||
<font color=darkgray>Difference between list and queue.</font> | <font color=darkgray>Difference between list and queue.</font> | ||
Revision as of 04:00, 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 in the queue. The queue implements the first-in-first-out, or FIFO, policy. Also see Stack.
Difference between list and queue.