programinhas/BinarySearchTree.py at master · nijek/programinhas · 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
from random import seed
from random import randint
import sys
sys.setrecursionlimit(17500)

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

    def add_value(self, value):
        node = Node(value)
        self.add_node(Node(value))


    def add_node(self, node):

        if node.value > self.value:
            if self.right == None:
                self.right = node
            else:
                self.right.add_node(node)
        elif node.value < self.value:
            if self.left == None:
                self.left = node
            else:

                self.left.add_node(node)

    def traversal(self):
        if self.left:
            self.left.traversal()
        print(self.value)
        if self.right:
            self.right.traversal()

    def print_node(self):
        print(self.value)
        if self.left != None:
            self.left.print_node()
        else:
            print("LEFT NULL")
        if self.right != None:
            self.right.print_node()
        else:
            print("RIGHT NULL")

class BinaryTree(Node):
    def __init__(self, value):
        super().__init__(value)
        self.value = value
        self.left = None
        self.right = None
    def root(self):
        return self.value
    def search_value(self, value):
        pass
    def min(self):
        val = self.value
        left = self.left
        while left != None:
            val = left.value
            left = left.left
        return val
    def max(self):
        val = self.value
        right = self.right
        while right != None:
            val = right.value
            right = right.right
        return val

    def add_value(self, value):
        node = Node(value)
        self.add_node(Node(value))


    def print_tree(self):
        print (self.value)
        if self.left != None:
            self.left.print_node()
        else:
            print("LEFT NULL")
        if self.right != None:
            self.right.print_node()
        else:
            print("RIGHT NULL")


seed()
tree = BinaryTree(randint(-10000,10000))
for i in range(4):
    tree.add_value(randint(-100000,100000))


#print(tree.min(), tree.max())
tree.traversal()
print("\n\n")
print(tree.min(), tree.max())