queue
123456789101112131415161718192021222324252627282930313233343536373839404142
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:
return "Queue is empty"
def front(self):
if not self.is_empty():
return self.items[0]
else:
return "Queue is empty"
def size(self):
return len(self.items)
# Example usage
queue = Queue()
print("Is the queue empty?", queue.is_empty()) # True
queue.enqueue("A")
queue.enqueue("B")
queue.enqueue("C")
print("Queue size:", queue.size()) # 3
print("Front item:", queue.front()) # A
print("Dequeued item:", queue.dequeue()) # A
print("New front item:", queue.front()) # B
print("Queue size after dequeue:", queue.size()) # 2
Python
INFO