queue

First In First Out (FIFO)
Only add at back, retrieve from front
Can use any front and back insertion sequence
By default a deque is used
front()  returns front element
push()  adds element to back
pop()  removes front element