-
Notifications
You must be signed in to change notification settings - Fork 0
/
1991.py
86 lines (65 loc) · 1.84 KB
/
1991.py
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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
import sys
class Node:
def __init__(self, element):
self.element = element
self.left = None
self.right = None
def __str__(self):
return str(self.element)
class Tree:
def __init__(self):
self.root = None
def find_r(self, letter, node):
if node is None:
return None
elif node.element == letter:
return node
else:
return self.find_r(letter, node.left) or self.find_r(letter, node.right)
def find(self, letter):
return self.find_r(letter, self.root)
def insert(self, curr, left, right):
node = self.find(curr)
if node is None:
self.root = Node(curr)
if left != ".":
self.root.left = Node(left)
if right != ".":
self.root.right = Node(right)
else:
if left != ".":
node.left = Node(left)
if right != ".":
node.right = Node(right)
def preorder(self, node):
if node is None:
return
else:
sys.stdout.write(str(node))
self.preorder(node.left)
self.preorder(node.right)
def inorder(self, node):
if node is None:
return
else:
self.inorder(node.left)
sys.stdout.write(str(node))
self.inorder(node.right)
def postorder(self, node):
if node is None:
return
else:
self.postorder(node.left)
self.postorder(node.right)
sys.stdout.write(str(node))
T = int(input())
tree = Tree()
for i in range(T):
curr, left, right = input().split()
tree.insert(curr, left, right)
tree.preorder(tree.root)
print("")
tree.inorder(tree.root)
print("")
tree.postorder(tree.root)
print("")