py_scripts/binary_search_tree.py at master · Burya94/py_scripts · 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
#!/usr/bin/python3


p = None
mass = []

class Node:
    def __init__(self, value):
        self.r = None
        self.l = None
        self.v = value


class Tree():
    def __init__(self):
        self.root = None

    def getroot(self):
        return self.root

    def add(self, value):
        if self.root == None:
            self.root = Node(value)
        else:
            self._add(value, self.root)

    def _add(self, value, node):
        global p
        if value == 0 and node.v != 0:
            if node.l == None:
                node.l = Node(value)
                p = node
            elif node.r == None:
                node.r = Node(value)
                p = node
        elif value == 0 and node.v == 0:
            self._add(value, p)
        else:
            if node.l == None:
                node.l = Node(value)
                p = node.l
            elif node.r == None:
                node.r = Node(value)
                p = node.r

    def find(self, value):
        if self.root != None:
            return self._find(value, self.root)
        else:
            return None

    def _find(self, value, node):
        if value == node.v:
            return node
        elif value < node.v and node.l != None:
            self._find(value, node.l)
        elif value > node.v and node.r != None:
            self._find(value, node.r)

    def delete_tree(self):
        self.root = None

    def printTree(self):
        if self.root != None:
            self._printTree(self.root)

    def _printTree(self, node):
        if node != None:
            self._printTree(node.l)
            mass.append(node.v)


def tree_build(mass):
    global p
    tree = Tree()
    tree.root = Node(mass[0])
    p = tree.root
    for i in range(1, len(mass)):
        if mass[i] != 0:
            tree._add(mass[i], p)
    tree.printTree()
    print(tree.find(10))


def main():
    with open('input_10a.txt', 'r') as file:
        mass = file.readline().split()
    tree_build(mass)


if __name__ == "__main__":
    main()