Educator

Queue

• A Queue is a data structure where data is stored and retrieved in a particular way, data elements are stored at the end of the list and are removed and processed from the beginning of the list.

• Queue is called a FIFO (First In First Out) structure.

• Common Operations allowed: Enqueue(insert), Dequeue(remove), Clear(delete all elements)

• Can be made using static arrays or linked list.