-
Notifications
You must be signed in to change notification settings - Fork 0
/
BST.py
175 lines (147 loc) · 4.75 KB
/
BST.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
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
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
from collections import deque
class node(object):
def __init__(self, value):
self.value = value
self.left = None
self.right = None
def getValue(self):
return self.value
def setValue(self, value):
self.value = value
def setLeftChild(self, node):
self.left = node
def setRightChild(self, node):
self.right = node
def getLeftChild(self):
return self.left
def getRightChild(self):
return self.right
def hasLeftChild(self):
return self.left != None
def hasRightChild(self):
return self.right != None
def _repr_(self):
return f"Node ({self.getValue()})"
def _str_(self):
return f"Node ({self.getValue()})"
class Tree(object):
def __init__(self, value):
self.root = None
def getRoot(self):
return self.root
def setRoot(self, value):
self.root = node(value)
def compare(self, node, newNode):
if newNode.getValue() == node.getValue():
return 0
elif newNode.getValue() < node.getValue():
return -1
else:
return 1
def insertWithLoop(self, newValue):
newNode = node(newValue)
node = self.getRoot()
if node == None:
self.root = newNode
return
while(True):
comparison = self.compare(node, newNode)
if comparison == 0:
break
elif comparison == -1:
if node.hasLeftChild():
node = node.getLeftChild()
else:
node.setLeftChild(newNode)
break
else:
if node.hasLeftChild():
node = node.getRightChild()
else:
node.setRightChild(newNode)
break
def insertWithRecursion(self, value):
if self.getRoot() == None:
self.setRoot(value)
return
self.insertRecursively(self.getRoot(), node(value))
def insertRecursively(self, node, newNode):
comparison = self.comapre(node, newNode)
if comparison == 0:
if node.hasLeftChild():
self.insertRecursively(node.getLeftChild(), newNode)
elif comparison == -1:
if node.hasLeftChild():
self.insertRecursively(node.getLeftChild(), newNode)
else:
node.setLeftChild(newNode)
else:
if node.hasRightChild():
self.insertRecursively(node.getRightChild(), newNode)
else:
node.setRightChild(newNode)
def _repr_(self):
level = 0
q = Queue()
visitOrder = list()
node = self.getRoot()
q.enq((node, level))
while len(q) > 0:
node, level = q.deq()
if node == None:
visitOrder.append(("<empty", level))
continue
visitOrder.append((node, level))
if node.hasLeftChild():
q.enq((node.getLeftChild(), level + 1))
else:
q.enq((None, level + 1))
s = "Tree \n"
previous_level = -1
for i in range(len(visitOrder)):
node, level = visitOrder[i]
if level == previous_level:
s += " | " + str(node)
else:
previous_level = level
return s
class Queue():
def __init__(self):
self.q = deque()
def enq(self, value):
self.q.appendleft(value)
def deq(self):
if len(self.q) > 0:
return self.q.pop()
else:
return None
def _len_(self):
return len(self.q)
def _repr_(self):
if len(self.q) > 0:
s = "< enqueue here >\n ________________________\n"
s += "\n______________________\n".join([str(item)
for item in self.q])
s += "\n_______________________\n <dequeue here >"
return s
else:
return "<queue is empty>"
def search(self, value):
node = self.getRoot()
s_node = node(value)
while(True):
comparison = self.comapre(node, s_node)
if comparison == 0:
return True
elif comparison == -1:
if node.hasLeftChild():
node = node.getLeftChild()
else:
return True
else:
if node.hasRightChild():
node = node.getRightChild()
else:
return False
# If duplicates then keep track or just overwrite it
# Two methods one by loop and recursion