백준:11725 파이썬 (Tree)

import sys
sys.setrecursionlimit(10**9)

T=int(input())

#트리
Tree= [[]for _ in range(T+1)]

#부모 노드 저장
Parents = [0 for _ in range(T+1)]
for _ in range(T-1):
    a,b = map(int,input().split())
    Tree[a].append(b)
    Tree[b].append(a)

def DFS(start,tree,parents):
    for i in tree[start]:
        if parents[i]==0:
            parents[i]=start
            DFS(i,tree,parents)
DFS(1,Tree,Parents)

for i in range(2,T+1): #2번노드부터 N번노드까지 ex 1~7->2~7
    print(Parents[i])