class Queue: def __init__(self): self.size = 0 self.storage = LinkedList() def __len__(self): return self.storage.get_length() def enqueue(self, value): self.storage.add_to_tail(value) return def dequeue(self): # Queue empty? Return None if self.storage.get_length() == 0: return None return self.storage.remove_head()
class Queue: def __init__(self): self.size = 0 # what data structure should we # use to store queue elements? - Linked List! self.storage = LinkedList() def enqueue(self, item): self.storage.add_to_tail(item) self.size += 1 def dequeue(self): if self.size > 0: self.size -= 1 return self.storage.remove_from_head() def len(self): return self.size
class Queue: def __int__(self): self.size = 0 self.storage = LinkedList() def __len__(self): return self.size def enqueue(self, value): # Add the new value to the tail of the list self.size += 1 self.storage.add_to_tail(value) def dequeue(self): if self.size == 0: return None # remove the value from the head of our list self.size -= 1 value = self.storage.remove_head() return value