[파이썬🐍] 백준 11725 : 트리의 부모 찾기

import sys
from collections import deque
input = sys.stdin.readline

def bfs(node):
    queue = deque()
    queue.append(node)
    while queue:
        node = queue.popleft()
        for n in graph[node]:
            if parents[n] == 0:
                parents[n] = node
                queue.append(n)
n = int(input())
graph = [[] for _ in range(n+1)]

for _ in range(n-1):
    u,v = map(int,input().split())
    graph[u].append(v)
    graph[v].append(u)
parents = [0]*(n+1)
bfs(1)
for i in range(2,n+1):
    print(parents[i])