Queue implementation using list

Queue.py

class Queue:
    def __init__(self):
        self.elements = []

    def enqueue(self, element):
        self.elements.insert(0,element)

    def dequeue(self):
        return self.elements.pop()
      
    def peek(self):
        return self.elements[len(self.elements)-1]

    def isEmpty(self):
        return self.elements == []

    def contains(self, element):
        if element in self.elements:
            return True
        return False

    def remove(self, element):
        if self.contains(element):
            self.elements.remove(element)