A simple implementation of Queue data structure in python

queue_python.py

# A simple implementation of Queue data structure in python
# FIFO: first (item) in, first (item) out
# Insert at the front, pop at the end of the list

class Queue():
    
    def __init__(self):
        self.items = []
        
    def isEmpty(self):
        return self.items == []
    
    def size(self):
        # size of the list
        return len(self.items)
    
    def enqueue(self, item):
        #insert the item in the front of the list
        self.items.insert(0,item)
        
    def dequeue(self):
        # removes and returns the last item in the list
        return self.items.pop()