Data Structure – codewindow.in

class CircularQueue:
    def __init__(self, size):
        self.size = size
        self.queue = [None] * size
        self.front = 0
        self.rear = 0

    def is_empty(self):
        return self.front == self.rear and self.queue[self.front] is None

    def is_full(self):
        return self.front == (self.rear + 1) % self.size

    def enqueue(self, data):
        if self.is_full():
            raise Exception("Queue is full")
        self.queue[self.rear] = data
        self.rear = (self.rear + 1) % self.size

    def dequeue(self):
        if self.is_empty():
            raise Exception("Queue is empty")
        data = self.queue[self.front]
        self.queue[self.front] = None
        self.front = (self.front + 1) % self.size
        return data