백준 11725 - 트리의 부모 찾기 (파이썬)

Answer

import sys

sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline

N = int(input())

tree = [[] for _ in range(N + 1)]
parents = [0] * (N + 1)

for _ in range(N - 1):
    a, b = map(int, input().split())

    tree[a].append(b)
    tree[b].append(a)

def dfs(start):
    for i in tree[start]:
        if parents[i] == 0:
            parents[i] = start
            dfs(i)
    return

dfs(1)

for i in range(2, N + 1):
    print(parents[i])