How do stacks and queues work?

Can you explain how stacks and queues work in programming?

Sure! Stacks and queues are both data structures used to store collections of items. A stack follows the Last In, First Out (LIFO) principle, meaning the last item added is the first one to be removed. A queue, on the other hand, follows the First In, First Out (FIFO) principle, where the first item added is the first one to be removed.

What are some real-world examples of stacks and queues?

Great question! A real-world example of a stack is a stack of plates; you can only take the top plate off. For queues, think of a line of people waiting for a bus; the first person in line is the first to get on the bus.

How do you implement a stack in Python?

You can implement a stack in Python using a list. You can use the append() method to add items and the pop() method to remove them. Here's a simple example:

stack = []
stack.append(1)  # Push 1 onto the stack
stack.append(2)  # Push 2 onto the stack
print(stack.pop())  # Outputs 2, the last item added