Queue Data Structure

class Queue:

    def __init__(self,size):
        self.items = []
        self.front = self.rear = 0 
        self.size = size

def enqueue(self,data):
        if not self.isFull()  :
            self.items.append(data)
            self.rear += 1 
            return f'{self.items[-1]} added'
        else:
            return 'full'

def dequeue(self):
        if not self.isEmpty() :
            self.items.pop(0)
            self.rear -= 1 
            return 'deleted successfuly'
        return 'empty'

    def isEmpty(self) -> bool:
        return  self.rear == self.front

    def isFull(self) -> bool :
        return self.size == self.rear