What are the common operations on queues and stacks?

What are the common operations on queues and stacks?

Common operations on stacks include push, pop, and peek. For queues, they include enqueue, dequeue, and peek.

Can you explain how the push and pop operations work in a stack?

Sure! The push operation adds an item to the top of the stack, while pop removes the item from the top.

What about the enqueue and dequeue operations in a queue?

Enqueue adds an item to the back of the queue, and dequeue removes an item from the front.

Are there any real-world applications for stacks and queues?

Yes! Stacks are used in function calls and undo mechanisms, while queues are used in scheduling and buffering.