A queue is a structure where the first element added is the first one removed (FIFO, first in first out). You enqueue at one end and dequeue at the other. It is used for task queues and breadth-first traversal. In Python, collections.deque offers O(1) operations at both ends.
Example
from collections import deque
f = deque()
f.append(1)
f.popleft()