Repository navigation
Expand file tree
/
Copy pathAvlTree.cpp
More file actions
207 lines (153 loc) · 4.54 KB
/
Copy pathAvlTree.cpp
File metadata and controls
207 lines (153 loc) · 4.54 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
#include "AvlTree.h"
AvlNode* AvlTree::rightRotate(AvlNode *y){
AvlNode *x = y->left;
AvlNode *temp2 = x->right;
// Perform rotation
x -> right = y;
y -> left = temp2;
return x;
}
AvlNode* AvlTree::leftRotate(AvlNode *x){
AvlNode *y = x->right;
AvlNode *temp2 = y->left;
// Perform rotation
y -> left = x;
x -> right = temp2;
return y;
}
int AvlTree::getBalance(AvlNode *node){
if(node == nullptr){
return -1;
}
return getHeight(node->left) - getHeight(node->right);
}
AvlNode* AvlTree::insert(AvlNode *r, AvlNode *newNode){
if(r == nullptr){
//why didn't the r change
r = newNode;
return r;
}else if(newNode->element < r->element){
r->left = insert(r->left, newNode);
}else if(newNode->element > r->element){
r->right = insert(r->right, newNode);
}else{
cout << "Duplicate Exist" << endl;
return r;
}
int balanceVal = getBalance(r);
//left left case
if(balanceVal > 1 && newNode->element < r->left->element){
return rightRotate(r);
}//right right case
else if(balanceVal < -1 && newNode->element > r->right->element){
return leftRotate(r);
}//left right case
else if(balanceVal > 1 && newNode->element > r->left->element){
r->left = leftRotate(r->left);
return rightRotate(r);
}//right left case
else if(balanceVal < -1 && newNode->element < r->right->element){
r->right = rightRotate(r->right);
return leftRotate(r);
}
return r;
}
AvlNode* AvlTree::deleteNode(AvlNode *node, Index element){
//base case
if(node == nullptr){
return nullptr;
}
//If the key is to be delete is smaller than the r's key
//then it lies in the left subtree
else if(element < node->element){
node->left = deleteNode(node->left, element);
}
//If the key to be deleted is greater than the r's key,
//then it is lies in right subtree
else if(element > node->element){
node->right = deleteNode(node->right, element);
}else{
//Value match
if(node->left == nullptr){
AvlNode* temp = node->right;
delete node;
return temp;
}else if(node->right == nullptr){
AvlNode* temp = node->left;
delete node;
return temp;
}else{
AvlNode* temp = minValue(node->right);
node->element = temp->element;
node->right = deleteNode(node->right, temp->element);
}
}
//Rebalance
int balanceVal = getBalance(node);
if(balanceVal == 2 && getBalance(node->left) >= 0){
return rightRotate(node);
}else if(balanceVal == 2 && getBalance(node->left) == -1){
node->left = leftRotate(node->left);
return rightRotate(node);
}else if(balanceVal == -2 && getBalance(node->right) <= 0){
return leftRotate(node);
}else if(balanceVal == -2 && getBalance(node->right) == 1){
node->right = rightRotate(node->right);
return leftRotate(node);
}
return node;
}
int AvlTree::getHeight(AvlNode* r){
if(r == nullptr){
return -1;
}else{
int lHeight = getHeight(r->left);
int rHeight = getHeight(r->right);
if(lHeight > rHeight){
return(lHeight + 1);
}else{ return(rHeight +1); }
}
}
void AvlTree::destroyAllNode(AvlNode* node){
if(node){
destroyAllNode(node->left);
destroyAllNode(node->right);
delete node;
}
}
AvlNode* AvlTree::search(AvlNode* node, Index element){
if(node == NULL || node->element == element) {
return node;
}
if(element < node->element){
return search(node->left, element);
}
if(element > node->element){
return search(node->right, element);
}
return NULL;
}
AvlNode* AvlTree::minValue(AvlNode *node) {
AvlNode *currentNode = node;
while(currentNode->left != nullptr){
currentNode = currentNode->left;
}
return currentNode;
}
void AvlTree::printTree(AvlNode *node, int space) {
if(node == nullptr){
return;
}
space += SPACE;
printTree(node->right, space);
cout << endl;
for (int i = SPACE; i < space; i++)
cout << " "; //
cout << node->getData().getWord() << endl;
printTree(node->left, space);
}
void AvlTree::replace(AvlNode *r, Index oldElement ,Index newElement){
auto* newNode = new AvlNode(newElement);
deleteNode(r, oldElement);
insert(r, newNode);
}