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
|
#include "tree-utils.h"
// Exercise 1
template <class T>
void myInsertInBST(Tree<T>* tree, const T& elem) {
if (elem > tree->data) {
if (tree->right == nullptr)
tree->right = new Tree<T>(elem);
else
myInsertInBST(tree->right, elem);
}
else {
if (tree->left == nullptr)
tree->left = new Tree<T>(elem);
else
myInsertInBST(tree->left, elem);
}
}
void ex1() {
Tree<int>* t = new Tree<int>(8, new Tree<int>(3, new Tree<int>(1), new Tree<int>(6, nullptr, new Tree<int>(7))), new Tree<int>(10, nullptr, new Tree<int>(14, new Tree<int>(13))));
myInsertInBST(t, 4);
printTree(t);
freeTree(t);
}
// Exercise 2
template <class T>
bool myContains(Tree<T>* tree, const T& elem) {
if (tree == nullptr) return false;
if (tree->data == elem) return true;
return myContains(tree->left, elem) || myContains(tree->right, elem);
}
template <class T>
bool myContainsBST(Tree<T>* tree, const T& elem) {
if (tree == nullptr) return false;
if (tree->data == elem)
return true;
else if (elem < tree->data)
return myContainsBST(tree->left, elem);
else
return myContainsBST(tree->right, elem);
}
void ex2() {
Tree<int>* t = new Tree<int>(8, new Tree<int>(3, new Tree<int>(1), new Tree<int>(6, new Tree<int>(4), new Tree<int>(7))), new Tree<int>(10, nullptr, new Tree<int>(14, new Tree<int>(13))));
std::cout << myContains(t, 9) << " " << myContains(t, 4) << std::endl;
std::cout << myContainsBST(t, 9) << " " << myContainsBST(t, 4) << std::endl;
freeTree(t);
}
// Exercise 3
template <class T>
void maxRec(Tree<T>* tree, T& max) {
if (tree == nullptr) return;
if (tree->data > max) max = tree->data;
maxRec(tree->left, max);
maxRec(tree->right, max);
}
template <class T>
T max(Tree<T>* tree) {
if (tree == nullptr) return T();
T max = tree->data;
maxRec(tree, max);
return max;
}
template <class T>
T maxBST(Tree<T>* tree) {
if (tree == nullptr) return T();
while (tree->right != nullptr) tree = tree->right;
return tree->data;
}
template <class T>
void minRec(Tree<T>* tree, T& max) {
if (tree == nullptr) return;
if (tree->data < max) max = tree->data;
minRec(tree->left, max);
minRec(tree->right, max);
}
template <class T>
T min(Tree<T>* tree) {
if (tree == nullptr) return T();
T max = tree->data;
minRec(tree, max);
return max;
}
template <class T>
T minBST(Tree<T>* tree) {
if (tree == nullptr) return T();
while (tree->left != nullptr) tree = tree->left;
return tree->data;
}
void ex3() {
Tree<int>* t = new Tree<int>(8, new Tree<int>(3, new Tree<int>(1), new Tree<int>(6, new Tree<int>(4), new Tree<int>(7))), new Tree<int>(10, nullptr, new Tree<int>(14, new Tree<int>(13))));
std::cout << max(t) << " " << maxBST(t) << std::endl;
std::cout << min(t) << " " << minBST(t) << std::endl;
freeTree(t);
}
// Exercise 4
template <class T>
void heightRec(Tree<T>* tree, int& result, int current = 0) {
if (tree == nullptr) return;
if (current > result) result = current;
heightRec(tree->left, result, current + 1);
heightRec(tree->right, result, current + 1);
}
template <class T>
int height(Tree<T>* tree) {
int result = 0;
heightRec(tree, result);
return result;
}
void ex4() {
Tree<int>* t = new Tree<int>(8, new Tree<int>(3, new Tree<int>(1), new Tree<int>(6, new Tree<int>(4), new Tree<int>(7))), new Tree<int>(10, nullptr, new Tree<int>(14, new Tree<int>(13))));
std::cout << height(t) << std::endl;
freeTree(t);
}
// Exercise 5
template <class T>
void inorderTraversal(Tree<T>* tree, void (*todo)(T)) {
if (tree == nullptr) return;
inorderTraversal(tree->left, todo);
todo(tree->data);
inorderTraversal(tree->right, todo);
}
template <class T>
void print(T elem) {
std::cout << elem << " ";
}
void ex5() {
Tree<int>* t = new Tree<int>(8, new Tree<int>(3, new Tree<int>(1), new Tree<int>(6, new Tree<int>(4), new Tree<int>(7))), new Tree<int>(10, nullptr, new Tree<int>(14, new Tree<int>(13))));
inorderTraversal(t, print); // on a BST, it prints all elements, in ascending order
std::cout << std::endl;
freeTree(t);
}
// main
int main() {
ex5();
}
|
