-
Notifications
You must be signed in to change notification settings - Fork 1
/
binarysearchtree.py
67 lines (55 loc) · 1.26 KB
/
binarysearchtree.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
66
67
from random import randint
class Node :
def __init__(self,value):
self.value = value
# TODO: add depth variable
self.left = None
self.right = None
def add_child(self,node):
if node.value < self.value:
if self.left == None:
self.left = node
else:
self.left.add_child(node)
elif node.value > self.value:
if self.right == None:
self.right = node
else:
self.right.add_child(node)
def visit(self):
# TODO: make print function
if self.left != None:
self.left.visit()
print(self.value)
if self.right != None:
self.right.visit()
def search(self,value):
if self.value == value:
print(f'found {value}')
elif value < self.value and self.left != None:
self.left.search(value)
elif value > self.value and self.right != None:
self.right.search(value)
else:
print(f'{value} not found')
return
class Tree :
def __init__(self):
self.root = None
def add_value(self,value):
node = Node(value)
if self.root == None:
self.root = node
return
else:
self.root.add_child(node)
def traverse(self):
self.root.visit()
def search(self,value):
self.root.search(value)
if __name__ == "__main__":
tree = Tree()
for i in range(0,15):
tree.add_value(randint(0,100))
tree.traverse()
tree.search(13)