1231. 중위순회 - Githubissues

# 1231. [S/W 문제해결 기본] 9일차 - 중위순회

import sys
sys.stdin = open("input.txt", "r")

def in_order(node):
    if node:
        in_order(data[node][2])
        print(data[node][1], end='')
        in_order(data[node][3])

for tc in range(1, 11):
    N = int(input())
    data = [list(map(lambda x: int(x) if x.isdecimal() else x, input().split())) for _ in range(N)]
    # print(data)

    for arr in data:
        while len(arr) != 4:
            arr.append(0)

    data.insert(0, [0, 0, 0, 0])
    # print(data)

    print(f'#{tc}', end=' ')
    in_order(1)
    print()

'''
def in_order(node):
    if node:
        in_order(data[node][2])         # left
        print(data[node][1], end='')    # root
        in_order(data[node][3])         # right

for tc in range(1, 2):
    N = int(input())
    # data = [input().split() for _ in range(N)]
    # print(data)
    # for i in range(N):
    #     for j in range(len(data[i])):
    #         if data[i][j].isdecimal():
    #             data[i][j] = int(data[i][j])
    # print(data)
    data = [list(map(lambda x: int(x) if x.isdecimal() else x, input().split())) for _ in range(N)]
    print(data)

    # 길이를 맞추기 위해서 0을 채워주기
    for arr in data:
        while (len(arr)) != 4:
            arr.append(0)

    # 노드와 인덱스 번호를 맞춰주기 위해서 추가
    data.insert(0, [0, 0, 0, 0])
    print(data)

    print(f'#{tc}', end=' ')
    in_order(1)
'''
JehooJeon / algorithm_review

1231. 중위순회 #2
