def push(self, element): n = Node(element) if self.top is None: self.top = n else: n.next = self.top self.top = n
class Queue(Stack): """implement a queue""" def __init__(self): pass def enqueue(self, element): if self.top is None: self.top = Node(element) else: self.top.appendToTail(Node(element)) def dequeue(self): self.pop() def showQueue(self): self.showStack()
def enqueue(self, element): if self.top is None: self.top = Node(element) else: self.top.appendToTail(Node(element))
