A queue exhibits First-In-First-Out (FIFO) behavior. It is a sequence of data items with the property that items can be removed only at one end, called the front of the queue, and items can be added only at the other end, called the back of queue.