Queues data structure in python

Python
1 
class queue:
    def __init__(self):
        self.queue = []

    def Enqueue(self, element):
        self.queue.append(element)
    
    def DEqueue(self):
        if not self.queue.__len__() == 0:
            return self.queue.pop(0)
        else:
            return "empty queue"

    def peek(self):
        if len(self.queue) != 0:
            return self.queue[0]
        else:
            return "empty queue"
        
    def isEmpty(self):
        if self.queue.__len__() == 0:
            return True
        else:
            return False
        
    def size(self):
        return self.queue.__len__()


queue1 = queue()

queue1.Enqueue(1)
queue1.Enqueue(2)
queue1.Enqueue(3)
queue1.Enqueue(4)

queue1.DEqueue()

print(queue1.peek())
print(queue1.isEmpty())
print(queue1.size())
2

Please Tell us what’s happening in your own words.

Learning to describe problems is hard, but it is an important part of learning how to code.

Also, the more you say, the more we can help!