
In Computer science, a queue is a dynamic data structure, used for storing items, before they are processed. A queue operates on a first-in, first-out FIFO principle, meaning the element that has been in the queue the longest is the next to be removed.
Generally, the following operations exist:
Items that are between the first and the last element of the queue are not directly accessible.
There is a specialization, called priority queue: In a priority queue, each item also has a weight, which determine the position of the item in a queue.