Module 3. Queue

A queue is an abstract list of nodes which follows First-In-First-Out data structure or FIFO
In this data structure a node can be added to the list at the rear-terminal only, known as Enqueue
and a node can be removed from the list at front-terminal only, known as Dequeue
Example: Queue for tickets at movie theatre 🎦

Queue

Files: Queue | Test