-
Notifications
You must be signed in to change notification settings - Fork 0
/
AVLTree.cpp
233 lines (214 loc) · 5.06 KB
/
AVLTree.cpp
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
#include "AVLTree.h"
#include <iostream>
using namespace std;
AVLTree::AVLTree() {
nodeCount = 0;
root = NULL;
}
AVLTree::~AVLTree() {
destructorHelper(root);
}
void AVLTree::destructorHelper(AVLNode* node) {
if (node) {
destructorHelper(node->left);
destructorHelper(node->right);
delete node;
}
}
void AVLTree::searchWord(string word) {
AVLNode* temp = getNode(word);
if (temp) {
cout << word << " found, count = "
<< temp->counter << endl;
temp = NULL;
delete temp;
}
else {
cout << word << " not found" << endl;
}
}
bool AVLTree::exists(string word) {
AVLNode* temp = getNode(word);
if (temp) {
temp = NULL;
delete temp;
return true;
}
else
return false;
}
AVLNode* AVLTree::getNode(string word) {
AVLNode* temp = new AVLNode;
temp = root;
while (temp) {
if (word.compare(temp->data) < 0)
temp = temp->left;
else if (word.compare(temp->data) > 0)
temp = temp->right;
else if (word.compare(temp->data) == 0) {
return temp;
}
}
return NULL;
}
void AVLTree::insertWord(string word, bool start) {
if (root == NULL) {
root = new AVLNode(word);
nodeCount = 1;
if (!start)
cout << word << " inserted, new count = 1" << endl;
return;
}
AVLNode* temp = getNode(word);
if ( temp ) {
temp->counter++;
if (!start)
cout << word << " inserted, new count = " <<
temp->counter << endl;
temp = NULL;
delete temp;
return;
}
temp = root;
while (temp) {
if (word.compare(temp->data) < 0) {
if (temp->left) {
temp = temp->left;
}
else {
temp->left = new AVLNode(word);
temp->left->parent = temp;
break;
}
}
else {
if (temp->right) {
temp = temp->right;
}
else {
temp->right = new AVLNode(word);
temp->right->parent = temp;
break;
}
}
}
while (temp != NULL) {
balance(temp);
temp = temp->parent;
}
temp = NULL;
delete temp;
if (!start)
cout << word << " inserted, new count = 1" << endl;
nodeCount++;
}
int AVLTree::height(AVLNode* node) {
if (node) {
int leftHeight = height(node->left);
int rightHeight = height(node->right);
if (leftHeight > rightHeight)
return 1 + leftHeight;
else
return 1 + rightHeight;
}
return 0;
}
int AVLTree::heightDifference(AVLNode* node) {
int leftHeight = height(node->left);
int rightHeight = height(node->right);
return leftHeight - rightHeight;
}
void AVLTree::balance(AVLNode* node) {
int difference = heightDifference(node);
if (difference > 2) {
if (heightDifference(node->left) > 0)
rotateLeftLeft(node);
else
rotateLeftRight(node);
}
else if (difference < -2) {
if (heightDifference(node->right) > 0)
rotateRightLeft(node);
else
rotateRightRight(node);
}
int x;
}
void AVLTree::rotateLeftLeft(AVLNode* node) {
if (node == root) {
root = node->left;
}
else {
if (node->data.compare(node->parent->data) < 0)
node->parent->left = node->left;
else
node->parent->right = node->left;
}
node->left->parent = node->parent;
AVLNode* temp = new AVLNode;
temp = node->left;
node->left = temp->right;
if (node->left)
node->left->parent = node;
node->parent = temp;
temp->right = node;
temp = NULL;
delete temp;
}
void AVLTree::rotateLeftRight(AVLNode* node) {
rotateRightRight(node->left);
rotateLeftLeft(node);
}
void AVLTree::rotateRightLeft(AVLNode* node) {
rotateLeftLeft(node->right);
rotateRightRight(node);
}
void AVLTree::rotateRightRight(AVLNode* node) {
if (node == root) {
root = node->right;
}
else {
if (node->data.compare(node->parent->data) < 0)
node->parent->left = node->right;
else
node->parent->right = node->right;
}
node->right->parent = node->parent;
AVLNode* temp = new AVLNode;
temp = node->right;
node->right = temp->left;
if (node->right)
node->right->parent = node;
node->parent = temp;
temp->left = node;
temp = NULL;
delete temp;
}
void AVLTree::rangeSearch(string start, string end) {
rangeSearchHelper(root, start, end);
}
void AVLTree::rangeSearchHelper(AVLNode* node, string start, string end) {
if (node == NULL)
return;
rangeSearchHelper(node->left, start, end);
if ( node->data.compare(start) >= 0 && node->data.compare(end) <= 0 )
cout << node->data << endl;
rangeSearchHelper(node->right, start, end);
}
void AVLTree::preOrderTraversal() {
preOrderTraversalHelper(root);
cout << endl;
}
void AVLTree::preOrderTraversalHelper(AVLNode* node) {
if (!node) {
cout << "()";
return;
}
cout << "(" << node->data << ":" << node->counter;
preOrderTraversalHelper(node->left);
preOrderTraversalHelper(node->right);
cout << ")";
}
void AVLTree::printHeight() {
cout << "Height = " << height(root) << endl;
}