-
-
Notifications
You must be signed in to change notification settings - Fork 21
/
D_level_order_traversal.py
49 lines (37 loc) · 1006 Bytes
/
D_level_order_traversal.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
class Node:
def __init__(self, key):
self.data = key
self.left = None
self.right = None
def printLevelOrder(root):
h = height(root)
for i in range(1, h + 1):
printGivenLevel(root, i)
def printGivenLevel(root, level):
if root is None:
return
if level == 1:
print(root.data, end=" ")
elif level > 1:
printGivenLevel(root.left, level - 1)
printGivenLevel(root.right, level - 1)
def height(node):
if node is 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 = Node(1)
root.left = Node(2)
root.right = Node(3)
root.left.left = Node(4)
root.left.right = Node(5)
print(timeit(lambda: printLevelOrder(root), number=10000)) # 0.054091101002995856
"""