A queue is the opposite of a stack: items join at the back and leave from the front. The first in is the first out: FIFO. Print jobs, customers waiting for support, and tasks waiting to run all form queues.

You could use a list, taking from the front with pop(0), but that's slow: every other item has to shuffle forward, so it's O(n). Python's collections.deque (pronounced "deck", short for double-ended queue) adds and removes at both ends in O(1):

from collections import deque

queue = deque()
queue.append("Ana")
queue.append("Ben")
queue.append("Cy")
print(queue.popleft())
print(queue.popleft())
print(queue)
print(len(queue))

append joins the back; popleft serves the front. A deque also has appendleft and pop, so it can act as a stack too.