It is a linear data structure in which all insertions are made from one end, called rear of the queue and all deletions are made from the other end, called the front of the queue.
It follows FIFO (First-in First-out).
To remove a newly inserted item from the queue, all the items inserted before the newly inserted item must be removed from the queue.