Write a python program to implement Queues.
from collections import deque
class Queue:
def __init__(self):
self.queue = deque()
def enqueue(self, item):
"""Adds an item to the end (rear) of the queue."""
self.queue.append(item)
print(f"Enqueued: {item}")
def dequeue(self):
"""Removes and returns the front item. Returns None if empty."""
if self.is_empty():
print("Queue Underflow: Cannot dequeue from an empty queue.")
return None
return self.queue.popleft()
def front(self):
"""Returns the front item without removing it."""
if self.is_empty():
return None
return self.queue[0]
def is_empty(self):
"""Checks if the queue is empty."""
return len(self.queue) == 0
# Usage
q = Queue()
q.enqueue("A")
q.enqueue("B")
print(f"Dequeued: {q.dequeue()}") # Returns "A"
print(f"Front element: {q.front()}") # Returns "B"
Comments
Post a Comment