Data Structures and Algorithms20775 marksBasic Concept of Queue, Queue as an ADT, Primitive Operation
Explain queue as an ADT.
Explain queue as an ADT. [5]
A queue is an ordered collection of items from which items may be deleted at one end (called the front) and into which items may be inserted at the other end (called the rear). A queue follows the FIFO (First-In-First-Out) principle, meaning the first element inserted into the queue is the first ...