-
-
Notifications
You must be signed in to change notification settings - Fork 21
/
E_tree_traversal_in_spiral_form.py
65 lines (45 loc) · 1.27 KB
/
E_tree_traversal_in_spiral_form.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
class newNode:
def __init__(self, key):
self.data = key
self.left = None
self.right = None
def printSpiral(root):
h = height(root)
ltr = False
for i in range(1, h + 1):
printGivenLevel(root, i, ltr)
ltr = not ltr
def printGivenLevel(root, level, ltr):
if root == None:
return
if level == 1:
print(root.data, end=" ")
elif level > 1:
if ltr:
printGivenLevel(root.left, level - 1, ltr)
printGivenLevel(root.right, level - 1, ltr)
else:
printGivenLevel(root.right, level - 1, ltr)
printGivenLevel(root.left, level - 1, ltr)
def height(node):
if node == None:
return 0
else:
lheight = height(node.left)
rheight = height(node.right)
if lheight > rheight:
return lheight + 1
else:
return rheight + 1
if __name__ == "__main__":
"""
from timeit import timeit
root = newNode(1)
root.left = newNode(2)
root.right = newNode(3)
root.left.left = newNode(7)
root.left.right = newNode(6)
root.right.left = newNode(5)
root.right.right = newNode(4)
print(timeit(lambda: printSpiral(root), number=10000)) # 0.08272517399745993
"""