A python program to implement a queue
class Queue:
def __init__(self):
self.items = []
def is_empty(self):
return len(self.items) == 0
def enqueue(self, item):
self.items.append(item)
def dequeue(self):
if not self.is_empty():
return self.items.pop(0)
else:
print("Queue is empty. Cannot dequeue from an empty queue.")
def front(self):
if not self.is_empty():
return self.items[0]
else:
print("Queue is empty. Cannot get front of an empty queue.")
def size(self):
return len(self.items)
# Example Usage:
my_queue = Queue()
my_queue.enqueue(1)
my_queue.enqueue(2)
my_queue.enqueue(3)
print("Current Queue:", my_queue.items)
print("Front Element:", my_queue.front())
print("Queue Size:", my_queue.size())
dequeued_item = my_queue.dequeue()
print("Dequeued Item:", dequeued_item)
print("Updated Queue:", my_queue.items)
output: