class Queue: def __init__(self): self.size = 0 self.storage = LinkedList() def __len__(self): return self.size def enqueue(self, value): self.storage.addToTail(value) self.size += 1 def dequeue(self): if self.size >= 1: self.size -= 1 return self.storage.removeHead() else: return
class Stack: def __init__(self): self.size = 0 self.storage = LinkedList() def __len__(self): return self.size pass def push(self, value): self.storage.addToTail(value) self.size += 1 def pop(self): if self.size >= 1: self.size -= 1 return self.storage.removeTail() else: return