🤍Queue: FIFO. 선입선출. 구현class Node: def __init__(self, item, next): self.item = item self.next = nextclass Queue: def __init__(self): self.front = None def pop(self): if not self.front: return None node = self.front self.front = self.front.next return node.item def push(self, value): if not self.front: self...