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
234
235
236
|
#include <iostream>
using namespace std;
typedef int tree_t;
typedef int link_t;
struct treeNode {
tree_t element;
treeNode* left;
treeNode* right;
treeNode(tree_t el) {
element = el;
left = NULL;
right = NULL;
}
};
struct linkNode {
link_t element;
linkNode* next;
linkNode(link_t el) {
element = el;
next = NULL;
}
};
void addElement(treeNode*&, tree_t&);
void deallocateTree(treeNode*&);
void printTree(treeNode*);
void deleteFromRoot(treeNode*&, tree_t&);
void deleteRoot(treeNode*&);
void deleteLeftMost(treeNode*&, tree_t&);
int treeHeight(treeNode*);
int max(int&, int&);
bool isBalanced(treeNode*);
int abs(int&);
void rotateRight(treeNode*&);
void rotateLeft(treeNode*&);
int largestElement(treeNode*);
void createList(treeNode*, linkNode*&);
void printList(linkNode*);
void deallocateList(linkNode*&);
int main() {
treeNode* firstTree = NULL;
linkNode* firstList = NULL;
tree_t newElement;
int n;
cout << "Enter number of elements: ";
cin >> n;
for(int i = 0; i < n; ++i) {
cin >> newElement;
addElement(firstTree, newElement);
}
cout << endl << "printing tree: " << endl;
printTree(firstTree);
cout << endl << "head root node: " << firstTree->element << endl;
cout << endl << "Height of tree: " << treeHeight(firstTree) << endl;
cout << endl << "Balanced Tree: " << isBalanced(firstTree) << endl;
cout << endl << "largest Element in tree: " << largestElement(firstTree);
//cout << endl << "Rotate left: " << endl;
//rotateLeft(firstTree);
//printTree(firstTree);
cout << endl << "Trying to balance tree: " << endl;
rotateRight(firstTree->right);
rotateLeft(firstTree);
cout << endl << "Height of tree: " << treeHeight(firstTree) << endl;
cout << endl << "Balanced Tree: " << isBalanced(firstTree) << endl;
cout << endl << "New head root node: " << firstTree->element << endl;
//cout << endl << "Rotating back right..." << endl;
//rotateRight(firstTree);
cout << endl << "Creating linked list: " << endl;
createList(firstTree, firstList);
printList(firstList);
deallocateTree(firstTree);
deallocateList(firstList);
cout << endl << "successfully deallocated tree and list..." << endl;
return 0;
}
void addElement(treeNode* &hdTree, tree_t &el) {
if(hdTree == NULL) {
treeNode* newTreeNode = new treeNode(el);
hdTree = newTreeNode;
} else if(el < hdTree->element) {
addElement(hdTree->left, el);
} else {
addElement(hdTree->right, el);
}
}
void deallocateTree(treeNode* &hdTree) {
if(hdTree != NULL) {
deallocateTree(hdTree->left);
deallocateTree(hdTree->right);
delete hdTree;
}
}
void printTree(treeNode* hdTree) {
if(hdTree != NULL) {
printTree(hdTree->left);
cout << hdTree->element << endl;
printTree(hdTree->right);
}
}
void deleteFromRoot(treeNode* &hdTree, tree_t &el) {
if(hdTree != NULL) {
if(hdTree->element == el) {
deleteRoot(hdTree);
} else if(hdTree->element > el) {
deleteFromRoot(hdTree->left, el);
} else {
deleteFromRoot(hdTree->right, el);
}
}
}
void deleteRoot(treeNode* &hdTree) {
treeNode* tmpPointer;
tree_t leftMost;
if(hdTree->right == NULL) {
tmpPointer = hdTree->left;
delete hdTree;
hdTree = tmpPointer;
} else {
deleteLeftMost(hdTree, leftMost);
hdTree->element = leftMost;
}
}
void deleteLeftMost(treeNode* &hdTree, tree_t &leftMost) {
if(hdTree->left == NULL) {
leftMost = hdTree->element;
deleteRoot(hdTree);
} else {
deleteLeftMost(hdTree->left, leftMost);
}
}
int treeHeight(treeNode* hdTree) {
if(hdTree == NULL) {
return -1;
}
return 1 + max(treeHeight(hdTree->left), treeHeight(hdTree->right));
}
int max(int &a, int &b) {
return (a >= b) ? a: b;
}
bool isBalanced(treeNode* hdTree) {
int lh, rh;
if(hdTree == NULL) {
return true;
}
lh = treeHeight(hdTree->left);
rh = treeHeight(hdTree->right);
int diff = lh - rh;
if(abs(diff) <= 1 && isBalanced(hdTree->left) && isBalanced(hdTree->right)) {
return true;
}
return false;
}
int abs(int &a) {
if(a > 0) {
return a;
}
return (-1)*a;
}
void rotateRight(treeNode* &hdTree) {
treeNode* tmpTree = hdTree;
hdTree = hdTree->left;
tmpTree->left = hdTree->right;
hdTree->right = tmpTree;
}
void rotateLeft(treeNode* &hdTree) {
treeNode* tmpTree = hdTree;
hdTree = hdTree->right;
tmpTree->right = hdTree->left;
hdTree->left = tmpTree;
}
int largestElement(treeNode* hdTree) {
if(hdTree->right == NULL) {
return hdTree->element;
}
return largestElement(hdTree->right);
}
void createList(treeNode* hdTree, linkNode* &hdList) {
if(hdTree != NULL) {
createList(hdTree->left, hdList);
linkNode* newElement = new linkNode(hdTree->element);
newElement->next = hdList;
hdList = newElement;
createList(hdTree->right, hdList);
}
}
void printList(linkNode* hdList) {
if(hdList != NULL) {
if(hdList->next == NULL) {
cout << hdList->element << endl;
} else {
cout << hdList->element << " -> ";
}
printList(hdList->next);
}
}
void deallocateList(linkNode* &hdList) {
if(hdList != NULL) {
linkNode* tmp = hdList->next;
delete hdList;
deallocateList(tmp);
}
}
|
