- LIFO(Last-in, First-out)
- push, peek, pop
class Stack(list): push = list.append def peek(self): return self[-1] # pop은 list 내장함수로 이미 존재
- FIFO(First-in, First-out)
- put, peek, get
class Queue(list): put = list.append def peek(self): return self[0] def get(self): return self.pop(0)