-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathtree_bottom_up_print.py
More file actions
51 lines (41 loc) · 862 Bytes
/
tree_bottom_up_print.py
File metadata and controls
51 lines (41 loc) · 862 Bytes
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
#Print a tree upside down
from binaryNode import *
root = Node(1)
node2 = Node(2)
node3 = Node(3)
node4 = Node(4)
node5 = Node(5)
node6 = Node(6)
node7 = Node(7)
node8 = Node(8)
node9 = Node(9)
root.left = node2
root.right = node3
node2.left = node4
node4.right = node5
node3.left = node6
node3.right = node7
node6.left = node8
node6.right = node9
def print_bottom_up(root):
if(root == None):
return
stack = []
level = []
level.append(root)
stack.append(level)
while(len(level)>0):
nextLevel = []
for node in level:
if(node.left):
nextLevel.append(node.left)
if(node.right):
nextLevel.append(node.right)
stack.append(nextLevel)
level = nextLevel
while(len(stack)> 0):
level = stack.pop()
for node in level:
print node.data, " " ,
print ""
print_bottom_up(root)