-
Notifications
You must be signed in to change notification settings - Fork 0
/
assignment4
218 lines (179 loc) · 5.38 KB
/
assignment4
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
#include <iostream>
using namespace std;
class AVLTree {
private:
struct Node {
int key;
Node* left;
Node* right;
int height;
Node(int k) : key(k), left(nullptr), right(nullptr), height(1) {}
};
Node* root;
int height(Node* n) {
return n ? n->height : 0;
}
int balanceFactor(Node* n) {
return n ? height(n->left) - height(n->right) : 0;
}
Node* rotateRight(Node* y) {
Node* x = y->left;
Node* T2 = x->right;
x->right = y;
y->left = T2;
y->height = max(height(y->left), height(y->right)) + 1;
x->height = max(height(x->left), height(x->right)) + 1;
return x;
}
Node* rotateLeft(Node* x) {
Node* y = x->right;
Node* T2 = y->left;
y->left = x;
x->right = T2;
x->height = max(height(x->left), height(x->right)) + 1;
y->height = max(height(y->left), height(y->right)) + 1;
return y;
}
Node* insert(Node* node, int key) {
if (!node) return new Node(key);
if (key < node->key)
node->left = insert(node->left, key);
else if (key > node->key)
node->right = insert(node->right, key);
else
return node;
node->height = 1 + max(height(node->left), height(node->right));
int balance = balanceFactor(node);
if (balance > 1 && key < node->left->key)
return rotateRight(node);
if (balance < -1 && key > node->right->key)
return rotateLeft(node);
if (balance > 1 && key > node->left->key) {
node->left = rotateLeft(node->left);
return rotateRight(node);
}
if (balance < -1 && key < node->right->key) {
node->right = rotateRight(node->right);
return rotateLeft(node);
}
return node;
}
Node* minValueNode(Node* node) {
Node* current = node;
while (current->left != nullptr)
current = current->left;
return current;
}
Node* deleteNode(Node* root, int key) {
if (!root) return root;
if (key < root->key)
root->left = deleteNode(root->left, key);
else if (key > root->key)
root->right = deleteNode(root->right, key);
else {
if (!root->left || !root->right) {
Node* temp = root->left ? root->left : root->right;
if (!temp) {
temp = root;
root = nullptr;
} else
*root = *temp;
delete temp;
} else {
Node* temp = minValueNode(root->right);
root->key = temp->key;
root->right = deleteNode(root->right, temp->key);
}
}
if (!root) return root;
root->height = 1 + max(height(root->left), height(root->right));
int balance = balanceFactor(root);
if (balance > 1 && balanceFactor(root->left) >= 0)
return rotateRight(root);
if (balance > 1 && balanceFactor(root->left) < 0) {
root->left = rotateLeft(root->left);
return rotateRight(root);
}
if (balance < -1 && balanceFactor(root->right) <= 0)
return rotateLeft(root);
if (balance < -1 && balanceFactor(root->right) > 0) {
root->right = rotateRight(root->right);
return rotateLeft(root);
}
return root;
}
Node* search(Node* root, int key) {
if (!root || root->key == key) return root;
if (root->key < key) return search(root->right, key);
return search(root->left, key);
}
void inOrder(Node* root) {
if (root) {
inOrder(root->left);
cout << root->key << " ";
inOrder(root->right);
}
}
void preOrder(Node* root) {
if (root) {
cout << root->key << " ";
preOrder(root->left);
preOrder(root->right);
}
}
void postOrder(Node* root) {
if (root) {
postOrder(root->left);
postOrder(root->right);
cout << root->key << " ";
}
}
public:
AVLTree() : root(nullptr) {}
void insert(int key) {
root = insert(root, key);
}
void deleteNode(int key) {
root = deleteNode(root, key);
}
bool search(int key) {
return search(root, key) != nullptr;
}
void inOrder() {
inOrder(root);
cout << endl;
}
void preOrder() {
preOrder(root);
cout << endl;
}
void postOrder() {
postOrder(root);
cout << endl;
}
};
int main() {
AVLTree tree;
cout << "Inserting nodes..." << endl;
tree.insert(10);
tree.insert(20);
tree.insert(30);
tree.insert(40);
tree.insert(50);
tree.insert(25);
cout << "In-order traversal: ";
tree.inOrder();
cout << "Pre-order traversal: ";
tree.preOrder();
cout << "Post-order traversal: ";
tree.postOrder();
cout << "Deleting node 40..." << endl;
tree.deleteNode(40);
cout << "In-order traversal after deletion: ";
tree.inOrder();
cout << "Searching for node 30: ";
cout << (tree.search(30) ? "Found" : "Not Found") << endl;
cout << "Searching for node 40: ";
cout << (tree.search(40) ? "Found" : "Not Found") << endl;
return 0;
}