DataStructures_lecture/slideno45.py at master · koolgax99/DataStructures_lecture · GitHub

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
class Node:
    def __init__(self,data):
        self.data = data
        self.left = None
        self.right = None

    def PostOrder(self, root):
        if root:
            self.PostOrder(root.left)
            self.PostOrder(root.right)
            print(root.data)

def prtLevelOrder(root):
    h = height(root)
    for i in range (1, h+1):
        prtLevel(root, i)

def prtLevel(root, level):
    if root is None:
        return
    if level==1:
        print(root.data)
    elif level>1:
        prtLevel(root.left, level-1)
        prtLevel(root.right, level-1)

def height(node): #function to define the height of the tree
    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

root = Node(30)
root.left = Node(15)
root.right = Node(35)
root.left.left = Node(10)
root.left.right = Node(20)
root.right.left = Node(32)
root.right.right = Node(40)
root.left.left.left = Node(8)
root.left.left.left.left = Node(5)
root.right.right.left = Node(37)
root.right.right.right = Node(45)
root.left.right.left = Node(16)
root.left.right.right = Node(25)

print("Level order traversal of binary tree is")
prtLevelOrder(root)

print("Post Order traversal: ")
root.PostOrder(root)