data-structures-algorithms/binary-tree/binary_search_tree_2.py at main · Bourbxn/data-structures-algorithms · 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
class Node:
    def __init__(self, data: float) -> None:
        self.data = data
        self.left = None
        self.right = None

    def __str__(self) -> str:
        return str(self.data)

class BinarySearchTree:
    def __init__(self) -> None:
        self.root = None

    def insert(self, data: float) -> None:
        self.root = self.insert_h(self.root, data)

    def insert_h(self, root: Node, data: float) -> Node:
        if not root:
            self.root = Node(data)
            return self.root
        else:
            if root.data == data:
                return root
            if data < root.data:
                root.left = self.insert_h(root.left, data)
            else:
                root.right = self.insert_h(root.right, data)
        return root

    def min_data(self) -> float:
        return self.min_data_h(self.root)

    def min_data_h(self, root: Node) -> float:
        if not root:
            return
        if not root.left:
            return root.data
        return self.min_data_h(root.left)

    def max_data(self) -> float:
        return self.max_data_h(self.root)

    def max_data_h(self, root: Node) -> float:
        if not root:
            return
        if not root.right:
            return root.data
        return self.max_data_h(root.right)

    def print_preorder(self) -> None:
        self.print_preorder_h(self.root)
        print()

    def print_preorder_h(self, root: Node) -> None:
        if root:
            print(root, end=' ')
            self.print_preorder_h(root.left)
            self.print_preorder_h(root.right)

    def print_inorder(self) -> None:
        self.print_inorder_h(self.root)
        print()

    def print_inorder_h(self, root: Node) -> None:
        if root:
            self.print_inorder_h(root.left)
            print(root, end=' ')
            self.print_inorder_h(root.right)

    def print_postorder(self) -> None:
        self.print_postorder_h(self.root)
        print()

    def print_postorder_h(self, root: Node) -> None:
        if root:
            self.print_postorder_h(root.left)
            self.print_postorder_h(root.right)
            print(root, end=' ')

    def print_breadth(self) -> None:
        self.print_breadth_h(self.root)
        print()

    def print_breadth_h(self, root: Node, l: list = []) -> None:
        if root:
            print(root, end=' ')
            if root.left:
                l.append(root.left)
            if root.right:
                l.append(root.right)
            if len(l):
                self.print_breadth_h(l.pop(0), l)

    def print_tree(self) -> None:
        self.print_tree_h(self.root)

    def print_tree_h(self, root: Node, level: int = 0) -> None:
        if root != None:
            self.print_tree_h(root.right, level + 1)
            print('     ' * level, root)
            self.print_tree_h(root.left, level + 1)

def main():
    pass
    # tree = BinarySearchTree()
    # tree.insert(20)
    # tree.insert(10)
    # tree.insert(30)
    # tree.print_tree()
    # tree.print_inorder()
    # tree.print_preorder()
    # tree.print_postorder()
    # tree.print_breadth()
    # print(tree.min_data())
    # print(tree.max_data())

if __name__ == '__main__':
    main()