Repository navigation
Expand file tree
/
Copy pathnew_avl_tree_map.py
More file actions
183 lines (141 loc) · 6.87 KB
/
Copy pathnew_avl_tree_map.py
File metadata and controls
183 lines (141 loc) · 6.87 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
from TdP_collections.map.avl_tree import TreeMap
class NewAVLTreeMap(TreeMap):
class _Node(TreeMap._Node):
# -------------------------- nested _Node class --------------------------
__slots__ = '_balance_factor'
def __init__(self, element, parent=None, left=None, right=None):
super().__init__(element, parent, left, right)
self._balance_factor = 0
def _isbalanced(self, p):
node = self._validate(p)
return -1 <= node._balance_factor <= 1
def _rebalance(self, p):
if p._node._balance_factor < 0:
if self.right(p)._node._balance_factor > 0:
self._rotate(self.left(self.right(p))) #rotate to right
"""Rotazione effettuata e ora è allineata"""
self.right(self.right(p))._node._balance_factor += -1 - max(self.right(p)._node._balance_factor, 0)
self.right(p)._node._balance_factor += -1 + min(self.right(self.right(p))._node._balance_factor, 0)
self._rotate(self.right(p)) #rotate to left
p._node._balance_factor += 1 - min(self.parent(p)._node._balance_factor, 0)
self.parent(p)._node._balance_factor += 1 + max(p._node._balance_factor, 0)
else:
self._rotate(self.right(p)) #rotate to left
p._node._balance_factor += 1 - min(self.parent(p)._node._balance_factor, 0)
self.parent(p)._node._balance_factor += 1 + max(p._node._balance_factor, 0)
return self.parent(p)
elif p._node._balance_factor > 0:
if self.left(p)._node._balance_factor < 0:
self._rotate(self.right(self.left(p))) #rotate left
"""Rotazione effettuata e ora è allineata"""
self.left(self.left(p))._node._balance_factor += 1 - min(self.left(p)._node._balance_factor, 0)
self.left(p)._node._balance_factor += 1 + max(self.left(self.left(p))._node._balance_factor, 0)
self._rotate(self.left(p)) #rotate right
p._node._balance_factor += -1 - max(self.parent(p)._node._balance_factor, 0)
self.parent(p)._node._balance_factor += -1 + min(p._node._balance_factor, 0)
else:
self._rotate(self.left(p)) #rotate right
p._node._balance_factor += -1 - max(self.parent(p)._node._balance_factor, 0)
self.parent(p)._node._balance_factor += -1 + min(p._node._balance_factor, 0)
return self.parent(p)
def _rebalance_delete_auxiliary(self, p, parent):
if parent is not None:
if p == self.left(parent):
parent._node._balance_factor -= 1
else:
parent._node._balance_factor += 1
if not self._isbalanced(parent):
self._rebalance(parent)
if update_p is not None:
p = update_p
else:
return
if parent._node._balance_factor == 0:
self._rebalance_delete_auxiliary(parent, self.parent(parent))
# ---------------------------- override balancing hooks -----------------------
def _rebalance_insert(self, p):
if not self._isbalanced(p):
self._rebalance(p)
return
parent = self.parent(p)
if parent is not None:
if p == self.left(parent):
parent._node._balance_factor += 1
else:
parent._node._balance_factor -= 1
if parent._node._balance_factor != 0:
self._rebalance_insert(parent)
def _rebalance_delete(self, p):
if not p:
return
elif not self.left(p) and not self.right(p):
p._node._balance_factor = 0
elif not self.left(p):
p._node._balance_factor -= 1
elif not self.right(p):
p._node._balance_factor += 1
else:
if self.num_children(self.left(p)) < self.num_children(self.right(p)):
p._node._balance_factor -= 1
elif self.num_children(self.left(p)) > self.num_children(self.right(p)):
p._node._balance_factor += 1
elif self.num_children(self.left(p)) == self.num_children(self.right(p)) == 0:
p._node._balance_factor = 0
if not self._isbalanced(p):
update_p=self._rebalance(p)
if update_p is not None:
p=update_p
else:
return
if p._node._balance_factor == 0:
self._rebalance_delete_auxiliary(p, self.parent(p))
if __name__ == '__main__':
a = NewAVLTreeMap()
for i in range(1, 16):
a[i] = i
print("------------------------Insert----------------------------")
print("Node|Balance Factor")
for k in a.inorder():
print(k.value(),"|",k._node._balance_factor)
print("------------------------Insert----------------------------")
for i in range (1, 16):
print("------------------------Delete----------------------------")
print("Elimino--->",a[i])
del a[i]
print("----------------------------------------------------------")
print("Node|Balance Factor")
for k in a.inorder():
print(k.value(),"|",k._node._balance_factor)
print("----------------------------------------------------------")
for i in range(1, 18):
a[i] = i
print("------------------------Insert----------------------------")
print("Node|Balance Factor")
for k in a.inorder():
print(k.value(),"|",k._node._balance_factor)
print("------------------------Insert----------------------------")
for i in reversed(range (1, 18)):
print("------------------------Delete----------------------------")
print("Elimino--->",a[i])
del a[i]
print("----------------------------------------------------------")
print("Node|Balance Factor")
for k in a.inorder():
print(k.value(),"|",k._node._balance_factor)
print("----------------------------------------------------------")
for i in range(1, 16):
a[i] = i
print("------------------------Insert----------------------------")
print("Node|Balance Factor")
for k in a.inorder():
print(k.value(),"|",k._node._balance_factor)
print("------------------------Insert----------------------------")
for i in range (4, 11):
print("------------------------Delete----------------------------")
print("Elimino--->",a[i])
del a[i]
print("----------------------------------------------------------")
print("Node|Balance Factor")
for k in a.inorder():
print(k.value(),"|",k._node._balance_factor)
print("----------------------------------------------------------")