/
pythonTree.py
65 lines (51 loc) · 1.48 KB
/
pythonTree.py
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
import random
class Node:
data = None
left = None
right = None
def __init__(self, initial_value):
self.data = initial_value
def add_node(self, new_node):
if not self:
self = new_node
elif new_node.data >= self.data:
if not self.right:
self.right = new_node
else:
self.right.add_node(new_node)
else:
if not self.left:
self.left = new_node
else:
self.left.add_node(new_node)
def print_in_order(self):
if self.left:
self.left.print_in_order()
if self:
print str(self.data),
if self.right:
self.right.print_in_order()
def check_in_order(self, mini, maxi):
if self.left:
self.left.check_in_order(mini, maxi)
if self:
print str("data= {} min={} max={}=> {}/{}".format(self.data))
if self.right:
self.right.check_in_order(mini, maxi)
if __name__ == "__main__":
root = Node(0)
for i in xrange(1, 10):
value = random.randint(1, 1000)
root.add_node(Node(value))
print value,
root.print_in_order()
root.check_in_order(0, 0)
print "\n---"
broken = Node(3)
broken.left = Node(2)
broken.left.left = Node(1)
broken.left.right = Node(4)
broken.right = Node(5)
broken.right.left = Node(6)
broken.print_in_order()
broken.check_in_order(3, 3)