[코테준비 python] 스택, 큐 자료구조 - 개발자 배찌

스택 자료구조
LIFO(LAST IN FIRST OUT) , 프링글스를 떠올리면 됨!

stack.append(5)
stack.pop()
stack.append(2)
stack.append(3)
stack.append(1)

print(stack[::-1])  #스택에 쌓인 반대로 출력  [1,3,2]
print(stack) #스택에 쌓인 순서대로 출력 [2,3,1]

큐 자료구조
FIFO(FIRST  IN FIRST OUT)

from collections import deque

queue = deque()

queue.append(5)
queue.popleft()
queue.append(3)
queue.append(2)
queue.append(1)
queue.popleft()

print(queue) #큐에 쌓인 순서대로 출력 [2,1]
queue.reverse()
print(queue) #큐에 쌓인 반대로 출력 [1,2]