Queues

• Like a queue at the supermarket

• Sequential data structure

• Oldest items are at the front

• Newest items are at the back

• Elements are 'enqueued' at the end

• Elements are 'dequeued' at the front

• First in, first out data structure