What\u2019s the secret behind web browsers remembering your navigation history or how printers manage multiple jobs in an orderly fashion? The answer lies in stacks and queues\u2014two foundational data structures that quietly power some of the most efficient algorithms and real-world systems. These deceptively simple tools are the backbone of many programming challenges, from reversing strings to managing recursive calls.<\/p>\n\n\n\n
In this blog, we\u2019re diving into the mechanics of stacks and queues, their practical uses, and how you can bring them to life with Python. No matter, if you\u2019re taking your first steps in programming or looking to enhance your expertise, mastering these structures, will give you the edge needed to solve increasingly complex problems.<\/p>\n\n\n\n
A stack is a linear data structure that follows the Last In, First Out<\/em> (LIFO) principle. This means the last item added to the stack is the first one to be removed. Think of it as a stack of plates in a cafeteria: you add plates to the top, and the last plate placed is the first one taken.<\/p>\n\n\n\n Key Operations:<\/strong><\/p>\n\n\n\n A queue is a linear data structure that adheres to the First In, First Out<\/em> (FIFO) principle. Imagine a queue at a ticket counter: the first person in line is the first to be served.<\/p>\n\n\n\n Python<\/a>\u2019s list data structure provides built-in methods that align with stack operations. Alternatively, we can use the collections.deque for optimized performance.<\/p>\n\n\n\n class Stack:<\/p>\n\n\n\n def __init__(self):<\/p>\n\n\n\n self.stack = []<\/p>\n\n\n\n def push(self, item):<\/p>\n\n\n\n self.stack.append(item)<\/p>\n\n\n\n def pop(self):<\/p>\n\n\n\n if not self.is_empty():<\/p>\n\n\n\n return self.stack.pop()<\/p>\n\n\n\n return “Stack is empty”<\/p>\n\n\n\n def peek(self):<\/p>\n\n\n\n if not self.is_empty():<\/p>\n\n\n\n return self.stack[-1]<\/p>\n\n\n\n return “Stack is empty”<\/p>\n\n\n\n def is_empty(self):<\/p>\n\n\n\n return len(self.stack) == 0<\/p>\n\n\n\n def size(self):<\/p>\n\n\n\n return len(self.stack)<\/p>\n\n\n\n s = Stack()<\/p>\n\n\n\n s.push(10)<\/p>\n\n\n\n s.push(20)<\/p>\n\n\n\n print(s.pop()) # Output: 20<\/p>\n\n\n\n print(s.peek()) # Output: 10<\/p>\n\n\n\n Using a list<\/a>, we can add elements to the end (enqueue) and access or inspect elements at the front (peek) without removing them. Although this approach is not the most efficient for large-scale operations, it is simple and effective for learning and smaller use cases.<\/p>\n\n\n\n class Queue:<\/p>\n\n\n\n def __init__(self):<\/p>\n\n\n\n self.queue = []<\/p>\n\n\n\n def enqueue(self, element):<\/p>\n\n\n\n self.queue.append(element)<\/p>\n\n\n\n print(f”{element} added to queue”)<\/p>\n\n\n\n def dequeue(self):<\/p>\n\n\n\n if not self.is_empty():<\/p>\n\n\n\n removed_element = self.queue.pop(0)<\/p>\n\n\n\n print(f”{removed_element} removed from queue”)<\/p>\n\n\n\n return removed_element<\/p>\n\n\n\n else:<\/p>\n\n\n\n print(“Queue is empty. Cannot dequeue.”)<\/p>\n\n\n\n return None<\/p>\n\n\n\n def is_empty(self):<\/p>\n\n\n\n return len(self.queue) == 0<\/p>\n\n\n\n def display(self):<\/p>\n\n\n\n print(“Queue contents:”, self.queue)<\/p>\n\n\n\n Example:<\/strong><\/p>\n\n\n\n queue = Queue()<\/p>\n\n\n\n queue.enqueue(1)<\/p>\n\n\n\n queue.enqueue(2)<\/p>\n\n\n\n queue.dequeue()<\/p>\n\n\n\n queue.display()<\/p>\n\n\n\n The deque from \u2019s collections module is a double-ended queue that allows fast appending and popping from both ends.<\/p>\n\n\n\n from collections import deque<\/p>\n\n\n\n class Queue:<\/p>\n\n\n\n def __init__(self):<\/p>\n\n\n\n self.queue = deque()<\/p>\n\n\n\n def enqueue(self, item):<\/p>\n\n\n\n self.queue.append(item)<\/p>\n\n\n\n def dequeue(self):<\/p>\n\n\n\n if not self.is_empty():<\/p>\n\n\n\n return self.queue.popleft()<\/p>\n\n\n\n return “Queue is empty”<\/p>\n\n\n\n def peek(self):<\/p>\n\n\n\n if not self.is_empty():<\/p>\n\n\n\n return self.queue[0]<\/p>\n\n\n\n return “Queue is empty”<\/p>\n\n\n\n def is_empty(self):<\/p>\n\n\n\n return len(self.queue) == 0<\/p>\n\n\n\n def size(self):<\/p>\n\n\n\n return len(self.queue)<\/p>\n\n\n\n q = Queue()<\/p>\n\n\n\n q.enqueue(1)<\/p>\n\n\n\n q.enqueue(2)<\/p>\n\n\n\n print(q.dequeue()) # Output: 1<\/p>\n\n\n\n print(q.peek()) # Output: 2<\/p>\n\n\n\n\n
Queues<\/strong><\/h3>\n\n\n\n
Key Operations:<\/strong><\/h4>\n\n\n\n
\n
Why Learn Stacks and Queues?<\/strong><\/h2>\n\n\n\n
\n
Implementing Stacks and Queues in Python<\/strong><\/h2>\n\n\n\n
1. Implementing a Stack<\/strong><\/h3>\n\n\n\n
Using list:<\/strong><\/h4>\n\n\n\n
Example:<\/strong><\/h4>\n\n\n\n
2. Implementing a Queue<\/strong><\/h3>\n\n\n\n
Queue Implementation Using List<\/strong><\/h4>\n\n\n\n
\n
Example Usage:<\/strong><\/h4>\n\n\n\n