-
Notifications
You must be signed in to change notification settings - Fork 0
/
avl_tree.cpp
223 lines (196 loc) · 5.7 KB
/
avl_tree.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
//
// Created by patha on 12-10-2021.
//
#include "bits/stdc++.h"
using namespace std;
struct AVLNode {
int data;
int height;
AVLNode *left;
AVLNode *right;
};
AVLNode *newNode(int data) {
AVLNode *temp = new AVLNode;
temp->data = data;
temp->height = 1;
temp->left = nullptr;
temp->right = nullptr;
return temp;
}
int getHeight(AVLNode *node) {
if (node == nullptr) {
return 0;
}
return node->height;
}
AVLNode *rightRotate(AVLNode *node) {
AVLNode *x = node->left;
AVLNode *t3 = x->right;
node->left = t3;
x->right = node;
node->height = max(getHeight(node->left), getHeight(node->right)) + 1;
x->height = max(getHeight(x->left), getHeight(x->right)) + 1;
return x;
}
AVLNode *leftRotate(AVLNode *node) {
AVLNode *x = node->right;
AVLNode *t3 = x->left;
node->right = t3;
x->left = node;
node->height = max(getHeight(node->right), getHeight(node->left)) + 1;
x->height = max(getHeight(x->right), getHeight(x->left)) + 1;
return x;
}
int getBalance(AVLNode *node) {
if (node == nullptr) {
return 0;
}
return getHeight(node->left) - getHeight(node->right);
}
AVLNode *insert(AVLNode *root, int data) {
if (root == nullptr) {
return newNode(data);
} else if (data < root->data) {
root->left = insert(root->left, data);
} else if (data > root->data) {
root->right = insert(root->right, data);
} else {
return root;
}
root->height = max(getHeight(root->right), getHeight(root->left)) + 1;
int balance = getBalance(root);
if (balance > 1 && data < root->left->data) {
return rightRotate(root);
}
if (balance < -1 && data > root->right->data) {
return leftRotate(root);
}
if (balance > 1 && data > root->left->data) {
root->left = leftRotate(root);
}
if (balance < -1 && data < root->right->data) {
root->right = rightRotate(root->right);
return leftRotate(root);
}
return root;
}
void levelOrder(AVLNode *root) {
if (root == nullptr) {
return;
}
queue<AVLNode *> que;
que.push(root);
while (!que.empty()) {
AVLNode *current = que.front();
cout << current->data << " ";
if (current->left != nullptr) que.push(current->left);
if (current->right != nullptr) que.push(current->right);
que.pop();
}
}
bool isBSTFast(AVLNode *root, int minData, int maxData) {
if (root == nullptr) {
return true;
}
if (root->data > minData && root->data < maxData && isBSTFast(root->left, minData, root->data) &&
isBSTFast(root->right, root->data, maxData)) {
return true;
}
return false;
}
void preOrder(AVLNode *root) {
if (root == nullptr) {
return;
}
cout << root->data << " ";
preOrder(root->left);
preOrder(root->right);
}
void inOrder(AVLNode *root) {
if (root == nullptr) {
return;
}
inOrder(root->left);
cout << root->data << " ";
inOrder(root->right);
}
int main() {
AVLNode *root = nullptr;
int ans = 1;
do {
if (ans == 1) {
int n;
cout << endl << "Enter no. of nodes of tree : ";
cin >> n;
while (n--) {
cout << endl << "Enter data : ";
int data;
cin >> data;
root = insert(root, data);
}
}
// else if (ans == 2) {
// int data;
// cout << endl << "Enter element to search for";
// cin >> data;
// if (search(root, data)) {
// cout << endl << "Element found";
// } else {
// cout << endl << "Element not found";
// }
// } else if (ans == 3) {
// cout << endl << "Minimum Element is :" << minInBST(root);
// } else if (ans == 4) {
// cout << endl << "Maximum Element in BST is : " << maxInBST(root);
// } else if (ans == 5) {
// cout << endl << "Height of tree is :" << findHeight(root);
// }
else if (ans == 6) {
cout << endl << "Level Order Traversal is :";
levelOrder(root);
} else if (ans == 7) {
cout << endl << "Pre-Order Traversal is :";
preOrder(root);
}
else if (ans == 8) {
cout << endl << "In-Order Traversal is :";
inOrder(root);
}
// else if (ans == 9) {
// cout << endl << "Post-Order Traversal is :";
// postOrder(root);
// } else if (ans == 10) {
// if (isBST(root)) {
// cout << endl << "Tree is BST. ";
// } else {
// cout << endl << "Tree is not BST";
// }
// }
else if (ans == 11) {
if (isBSTFast(root, INT_MIN, INT_MAX)) {
cout << endl << "Tree is BST. ";
} else {
cout << endl << "Tree is not BST";
}
}
// else if (ans == 12) {
// cout << endl << "Enter element to delete";
// int data;
// cin >> data;
// root = deleteNode(root, data);
// } else if (ans == 13) {
// cout << endl << "Enter element data to find inorder Successor :";
// int data;
// cin >> data;
// cout << endl << "Inorder Successor is :" << getInOrderSuccessor(root, data)->data;
// }
else {
break;
}
cout << endl << "---------------------------------";
cout << endl << "Enter choice : ";
cin >> ans;
cout << "---------------------------------";
} while (true);
return 0;
}