Use lists to implement stack (LIFO) or queue (FIFO) data structures.
Source Code
stack = []
stack.append('a') # Push onto the stack
stack.pop() # Pop off the stack
from collections import deque
queue = deque()
queue.append('a') # Enqueue
queue.popleft() # Dequeue