-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathavl.py
More file actions
410 lines (305 loc) · 11.6 KB
/
avl.py
File metadata and controls
410 lines (305 loc) · 11.6 KB
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
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
from node import Node
from bin import Bin
from object import Color
from object import Object
def comp_1(node_1, node_2):
if node_1.si==node_2.si:
return node_1.ID < node_2.ID
return node_1.si < node_2.si
def comp_2(node_1,node_2):
return node_1.ID < node_2.ID
class AVLTree:
def __init__(self, a):
if a==1:
compare_function = comp_1
else:
compare_function = comp_2
self.root = None
self.size = 0
self.comparator = compare_function
def height(self,node):
if not node:
return 0
else:
return node.height
def balance(self,node):
if not node:
return 0
else:
return self.height(node.left) - self.height(node.right)
def insert(self,root,node):
if root is None:
node.left = None
node.right = None
node.height = 1
return node
else:
if self.comparator(node,root) :
root.left = self.insert(root.left,node)
elif self.comparator(root,node):
root.right = self.insert(root.right,node)
root.height = 1 + max(self.height(root.left), self.height(root.right))
balance = self.balance(root)
#print(f"Balance factor at node {root.si}: {balance}")
if balance > 1 and self.comparator(node,root.left):
#print(f"Right rotation at node {root.si}")
root = self.rightrotation(root)
if balance < -1 and self.comparator(root.right,node):
#print(f"Left rotation at node {root.si}")
root = self.leftrotation(root)
if balance > 1 and self.comparator(root.left,node):
root.left = self.leftrotation(root.left)
root= self.rightrotation(root)
if balance < -1 and self.comparator(node,root.right):
root.right = self.rightrotation(root.right)
root = self.leftrotation(root)
return root
def delete(self, root, node):
if not root:
return root
if self.comparator(node,root):
root.left = self.delete(root.left, node)
elif self.comparator(root,node):
root.right = self.delete(root.right, node)
else:
if not root.left:
temp = root.right
root = None
return temp
elif not root.right:
temp = root.left
root = None
return temp
temp = self.min_value_node(root.right)
root.right = self.delete(root.right, temp)
root.si = temp.si
root.ID = temp.ID
root.l = temp.l
temp.right = root.right
temp.left = root.left
temp.height = root.height
if root==None:
return root
root.height = 1 + max(self.height(root.left), self.height(root.right))
#print(root.height)
balance = self.balance(root)
#print(balance)
# Left rotation
if balance > 1 and self.balance(root.left) >= 0:
root = self.rightrotation(root)
# Right rotation
if balance < -1 and self.balance(root.right) <= 0:
root = self.leftrotation(root)
# Left-Right rotation
if balance > 1 and self.balance(root.left) < 0:
root.left = self.leftrotation(root.left)
root = self.rightrotation(root)
# Right-Left rotation
if balance < -1 and self.balance(root.right) > 0:
root.right = self.rightrotation(root.right)
root = self.leftrotation(root)
return root
def deleteOb(self, root, object):
if not root:
return root
if self.comparator(object,root):
root.left = self.deleteOb(root.left, object)
elif self.comparator(root,object):
root.right = self.deleteOb(root.right, object)
else:
if not root.left:
temp = root.right
root = None
return temp
elif not root.right:
temp = root.left
root = None
return temp
temp = self.min_value_node(root.right)
root.right = self.deleteOb(root.right, temp)
if temp!=None:
root.size = temp.size
root.ID = temp.ID
root.color = temp.color
root.BIN_id = temp.BIN_id
temp.right = root.right
temp.left = root.left
temp.height = root.height
if root==None:
return root
root.height = 1 + max(self.height(root.left), self.height(root.right))
#print(root.height)
balance = self.balance(root)
#print(balance)
# Left rotation
if balance > 1 and self.balance(root.left) >= 0:
root = self.rightrotation(root)
# Right rotation
if balance < -1 and self.balance(root.right) <= 0:
root = self.leftrotation(root)
# Left-Right rotation
if balance > 1 and self.balance(root.left) < 0:
root.left = self.leftrotation(root.left)
root = self.rightrotation(root)
# Right-Left rotation
if balance < -1 and self.balance(root.right) > 0:
root.right = self.rightrotation(root.right)
root = self.leftrotation(root)
return root
def leftrotation(self, z):
"""y = z.right
T2 = y.left
y.left = z
z.right = T2
z.height = 1 + max(self.height(z.left), self.height(z.right))
y.height = 1 + max(self.height(y.left), self.height(y.right))
return y"""
if z.right is None:
return z
y = z.right
T2 = y.left
# Perform the rotation
y.left = z
z.right = T2
# Update heights
z.height = 1 + max(self.height(z.left), self.height(z.right))
y.height = 1 + max(self.height(y.left), self.height(y.right))
return y
def rightrotation(self, z):
"""print("Rotating")
print(z.ID)
y = z.left
T3 = y.right
y.right = z
z.left = T3
z.height = 1 + max(self.height(z.left), self.height(z.right))
y.height = 1 + max(self.height(y.left), self.height(y.right))
return y"""
# Check if the left child exists before proceeding
if z.left is None:
return z # Return the node as it is since rotation can't happen
y = z.left
T3 = y.right
# Perform the rotation
y.right = z
z.left = T3
# Update heights
z.height = 1 + max(self.height(z.left), self.height(z.right))
y.height = 1 + max(self.height(y.left), self.height(y.right))
return y
def min_value_node(self, root):
current = root
while current.left:
current = current.left
return current
def search(self, root, value,a):
if a==1:
if not root or root.si == value:
return root
if root.si < value:
return self.search(root.right, value,a)
return self.search(root.left, value,a)
else:
if not root or root.ID == value:
return root
if root.ID < value:
return self.search(root.right, value,0)
return self.search(root.left, value,0)
def findadd_bin(self,root,object_id,size,colori):
if colori == Color.BLUE:
return self.Bl(root,object_id,size)
elif colori== Color.YELLOW:
return self.Y(root,object_id,size)
elif colori== Color.RED:
return self.R(root,object_id,size)
elif colori==Color.GREEN:
return self.G(root,object_id,size)
def Bl(self,root,object_id,size):
n = root
if n.si < size:
if n.right== None:
return None
n = self.Bl(n.right,object_id,size)
return n
else:
if n.left==None:
return n
n = self.Bl(n.left,object_id,size)
if n==None:
return root
else:
return n
def Y(self,root,object_id,size):
n = root
if n.si < size:
if n.right:
return self.Y(n.right,object_id,size)
else:
return n
else:
if n.left:
b = self.Y(n.left,object_id,size)
if b.si < n.si and b.si >= size:
return b
else:
if n.right:
c = self.Y(n.right,object_id,size)
if c!=None and c.si == n.si:
return c
else:
return n
else:
return n
else:
if n.right:
c = self.Y(n.right,object_id,size)
if c.si == n.si:
return c
else:
return n
else:
return n
def R(self,root,object_id,size):
n = root
if n.right!=None:
if n.right.si > n.si:
n = self.R(n.right,object_id,size)
return n
else:
if n.left:
b = self.R(n.left,object_id,size)
if b.si == n.si:
return b
else:
n = self.R(n.right,object_id,size)
if n.si == root.si:
return root
else:
return n
else:
n = self.R(n.right,object_id,size)
if n.si == root.si:
return root
else:
return n
else:
if n.left:
c = self.R(n.left,object_id,size)
if c.si==n.si:
return c
else:
return n
else:
return n
def G(self,root,object_id,size):
n = self.root
while n.right!=None:
n = n.right
return n
def printo(self,root):
if root is None:
return
else:
print(root.si)
self.printo(root.left)
self.printo(root.right)