data-structures-and-algorithms/python/data_structures/binary_tree.py at main · xind14/data-structures-and-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
class BinaryTree:

    def __init__(self):
        self.root = None

    def pre_order(self, root = None, node=None):
        if node is None:
            node = []
        if root is None:
            root = self.root
        if root:
            node.append(root.value)
            if root.left:
                self.pre_order(root.left, node)
            if root.right:
                self.pre_order(root.right, node)
        return node


    def in_order(self, root=None, node=None):
        if node is None:
            node = []
        if root is  None:
            root = self.root
        if root:
            if root.left:
                self.in_order(root.left, node)
            node.append(root.value)
            if root.right:
                self.in_order(root.right, node)
        return node


    def post_order(self, root=None, node=None):
        if node is None:
            node = []
        if root is  None:
            root = self.root
        if root:
            if root.left:
                self.post_order(root.left, node)
            if root.right:
                self.post_order(root.right, node)
            node.append(root.value)
        return node


    def find_maximum_value(self):
        nodes = self.in_order()

        if not nodes:
            return None

        max_value = nodes[0]

        for node_value in nodes[1:]:
            if node_value > max_value:
                max_value = node_value

        return max_value


class Node:
    def __init__(self, value):
        self.value = value
        self.left = None
        self.right = None