-
Notifications
You must be signed in to change notification settings - Fork 4
/
treeViews.py
148 lines (122 loc) · 3.39 KB
/
treeViews.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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
import queue
from collections import OrderedDict
from Tree.commons.commons import insert, Node, print_tree
max_level = -1
def left_view(root, curr_level=0):
global max_level
if root is None:
return
if max_level < curr_level:
print(root.key, end=',')
max_level = curr_level
# Recur for left subtree first, then right subtree
left_view(root.left, curr_level + 1)
left_view(root.right, curr_level + 1)
def right_view(root, curr_level=0):
global max_level
if root is None:
return
if max_level < curr_level:
print(root.key, end=',')
max_level = curr_level
# Recur for right subtree first, then left subtree
right_view(root.right, curr_level + 1)
right_view(root.left, curr_level + 1)
def top_view(root):
hm = {}
q = queue.Queue()
root.hd = 0
q.put(root)
hm[0] = root.key
while not q.empty():
popped_node = q.get()
if popped_node.left is not None:
popped_node.left.hd = popped_node.hd - 1
if popped_node.left.hd not in hm:
hm[popped_node.left.hd] = popped_node.left.key
q.put(popped_node.left)
if popped_node.right is not None:
popped_node.right.hd = popped_node.hd + 1
if popped_node.right.hd not in hm:
hm[popped_node.right.hd] = popped_node.right.key
q.put(popped_node.right)
hm = OrderedDict(sorted(hm.items()))
return hm.values()
def bottom_view(root):
hm = {}
q = queue.Queue()
root.hd = 0
q.put(root)
hm[0] = root.key
while not q.empty():
popped_node = q.get()
if popped_node.left is not None:
popped_node.left.hd = popped_node.hd - 1
hm[popped_node.left.hd] = popped_node.left.key
q.put(popped_node.left)
if popped_node.right is not None:
popped_node.right.hd = popped_node.hd + 1
hm[popped_node.right.hd] = popped_node.right.key
q.put(popped_node.right)
hm = OrderedDict(sorted(hm.items()))
return hm.values()
# Driver program to test above function
if __name__ == "__main__":
""" Let us create following BST
50
/ \
30 70
/ \ / \
20 40 60 80
/ \
15 25
"""
root = None
root = insert(root, 50)
insert(root, 30)
insert(root, 20)
insert(root, 15)
insert(root, 25)
insert(root, 40)
insert(root, 70)
insert(root, 60)
insert(root, 80)
print("\n ---- Left View ---- \n")
left_view(root, 0)
print("\n")
print("\n ---- Right View ---- \n")
right_view(root, 0)
print("\n")
print("\n ---- Top View ---- \n")
top_view_nodes = top_view(root)
print(top_view_nodes)
print("\n ---- Bottom View ---- \n")
bottom_view_nodes = bottom_view(root)
print(bottom_view_nodes)
# root2 = Node(
# 20,
# left=Node(
# 8,
# left=Node(
# 5
# ),
# right=Node(
# 3,
# left=Node(
# 10
# ),
# right=Node(
# 14
# )
# )
# ),
# right=Node(
# 22,
# left=Node(
# 4
# ),
# right=Node(
# 25
# )
# )
# )