class Stack: def __init__(self): self.size = 0 self.storage = LinkedList() def __len__(self): return self.storage.getSize() def push(self, value): self.storage.add_to_tail(value) def pop(self): return self.storage.remove_tail()
class Queue: def __init__(self): self.size = 0 self.storage = LinkedList(); def __len__(self): return self.storage.getSize(); def enqueue(self, value): self.storage.add_to_tail(value); def dequeue(self): return self.storage.remove_head();