Data-structure-with-python/binarytree.py at main · yash9323/Data-structure-with-python · 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
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

from collections import deque
class BinaryTree:
    def __init__(self,data):
        self.root = self.tree_node(data)

    class tree_node:
        def __init__(self,data,left=None,right=None):
            self.data = data
            self.left = left
            self.right = right

    def level_order_traversal(self):
        q = deque()
        q.append(self.root)
        while q :
            curr = q.popleft()
            print(curr.data,end=" ")
            if curr.left:
                q.append(curr.left)
            if curr.right :
                q.append(curr.right)

    def in_order_traversal(self):
        s = deque()
        curr = self.root
        while s or curr :
            if curr:
                s.append(curr)
                curr = curr.left
            else:
                curr = s.pop()
                print(curr.data,end=" ")
                curr = curr.right

    def post_order_traversal(self):
        s = deque()
        q = deque()
        q.append(self.root)
        while q:
            curr = q.pop()
            s.append(curr.data)
            if curr.left:
                q.append(curr.left)
            if curr.right:
                q.append(curr.right)
        while s:
            print(s.pop(),end=" ")

    def pre_order_traversal(self):
        s= deque()
        s.append(self.root)
        while s :
            curr = s.pop()
            print(curr.data)
            if curr.right:
                s.append(curr.right)
            if curr.left:
                s.append(curr.left)

    def height(self):
        q=deque()
        q.append(self.root)
        ht=0
        while q :
            size=len(q)
            while size>0:
                curr=q.popleft()
                if curr.left:
                    q.append(curr.left)
                if curr.right:
                    q.append(curr.right)
                size=size-1
            ht=ht+1
        print("Height of tree is :",ht)

    def insert_auto(self,data):
        curr = self.root
        while True:
            if data < curr.data:
                if curr.left is None:
                    curr.left = self.tree_node(data)
                    break
                else:
                    curr = curr.left
            if data > curr.data:
                if curr.right is None :
                    curr.right = self.tree_node(data)
                    break
                else:
                    curr = curr.right

    def insert_right(self,data):
        curr = self.root.right
        while True:
            if data < curr.data:
                if curr.left is None:
                    curr.left = self.tree_node(data)
                    break
                else:
                    curr = curr.left
            if data > curr.data:
                if curr.right is None :
                    curr.right = self.tree_node(data)
                    break
                else:
                    curr = curr.right

    def insert_left(self,data):
        curr = self.root.left
        while True:
            if data < curr.data:
                if curr.left is None:
                    curr.left = self.tree_node(data)
                    break
                else:
                    curr = curr.left
            if data > curr.data:
                if curr.right is None :
                    curr.right = self.tree_node(data)
                    break
                else:
                    curr = curr.right