Grokking Data Structures & Algorithms for Coding Interviews
Vote

0% completed

​

Types of Queue

Queues come in different variations based on how elements are inserted, removed, and prioritized. The basic queue follows the First-In, First-Out (FIFO) rule: the first element added is the first one removed. Some variations keep that rule and change only how the memory behind the queue is used. Others break it on purpose. A deque lets an element leave from either end. A priority queue lets an element go first because of its priority, not its arrival time. The comparison table at the end of this lesson shows which type keeps FIFO and which does not.

.....

.....

.....

Like the course? Get enrolled and start learning!
E

ethanedge

· 2 months ago

The introduction states "While all queues follow the First-In, First-Out (FIFO) principle" but then Deques and Priority Queues are mentioned and described as NOT being FIFO.

Show 1 reply

Reading Progress

0%

Vote for new content