2022.02.19 [백준] (python 파이썬) 트리 순회

 

https://www.acmicpc.net/problem/1991

1991번: 트리 순회

---

풀이

 

n=int(input())
tree={}
for i in range(n):
    root, left, right = input().split()
    tree[root]=[left,right]
 
def Preorder(root):
    if root!='.':
        print(root,end='')
        Preorder(tree[root][0])
        Preorder(tree[root][1])
 
def Inorder(root):
    if root !='.':
        Inorder(tree[root][0])
        print(root,end='')
        Inorder(tree[root][1])
 
def Postorder(root):
    if root!='.':
        Postorder(tree[root][0])
        Postorder(tree[root][1])
        print(root,end='')
 
Preorder('A')
print()
Inorder('A')
print()
Postorder('A')