Stack vs Queue
Queue, aka FIFO data structure (first in, first out)
Insert and delete are called enqueue and dequeue
Applications:
- the checkout at a supermarket
- objects flowing through a pipe (where they cannot overtake each other)
- chat messages
- printing jobs arriving at a printer
- …
|