class Queue:
def __init__(self):
self.first = None
self.last = None
self.size = 0
def enQueue(self, item):
if(self.first == None):
self.first = Node(None,item);
self.last = self.first
else:
self.last.setNext(Node(None,item))
self.last = self.last.getNext()
self.size += 1
def deQueue(self):
if(self.first != None):
node = self.first
self.first = self.first.getNext()
self.size -= 1
return node.item
return None
def isEmpty(self):
return self.size == 0
def qSize(self):
return self.size
def printQueue(self):
node = self.first
q = []
while(node != None):
q.append(node.item)
node = node.next
return (str)(q)
