A First-In, First-Out (FIFO) data structure. Like a queue at a grocery store, the first person to arrive is the first to be served.
1function dequeue():2 if isEmpty: return Error3 return queue[front++]
Ready for operations