How do I implement stacks and queues in Python?

How do I implement stacks and queues in Python?

You can implement stacks using a list with append() and pop() methods. For queues, use collections.deque for efficient FIFO operations.

Can you show me a simple example of both?

Sure! For a stack:

stack = []
stack.append(1)
stack.append(2)
print(stack.pop())  # Outputs: 2

For a queue:

from collections import deque
queue = deque()
queue.append(1)
queue.append(2)
print(queue.popleft())  # Outputs: 1

What are the main differences between stacks and queues?

Stacks follow LIFO (Last In, First Out) while queues follow FIFO (First In, First Out). This affects how elements are added and removed.

Are there any built-in libraries in Python for these data structures?

Yes, Python's list can be used for stacks, and the collections module provides deque for queues, which is optimized for fast appends and pops.