Algorithm/Baek_1991.py at master · rukipgus/Algorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
import sys

class node:
    def __init__(self, item, lchild, rchild):
        self.item = item
        self.lchild = lchild
        self. rchild = rchild

def preorder(node):
    print(node.item, end = "")
    if node.lchild != ".":
        preorder(tree[node.lchild])
    if node.rchild != ".":
        preorder(tree[node.rchild])

def inorder(node):
    if node.lchild != ".":
        inorder(tree[node.lchild])
    print(node.item, end = "")
    if node.rchild != ".":
        inorder(tree[node.rchild])

def postorder(node):
    if node.lchild != ".":
        postorder(tree[node.lchild])
    if node.rchild != ".":
        postorder(tree[node.rchild])
    print(node.item, end = "")

n = int(sys.stdin.readline())

tree = {}

for i in range(n):
    x, y, z = sys.stdin.readline().split()
    tree[x] = node(item = x, lchild = y, rchild = z)

preorder(tree["A"])
print()
inorder(tree["A"])
print()
postorder(tree["A"])