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
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
|
#include "binary_tree.h"
#include <cgreen/cgreen.h>
#include <string.h>
int visited[256];
int visited_count;
Describe(BinaryTree);
BeforeEach(BinaryTree) {
memset(visited, 0, sizeof(visited));
visited_count = 0;
}
AfterEach(BinaryTree) {}
void visitor(Node *node) {
visited[visited_count] = node->data;
visited_count++;
}
Ensure(BinaryTree, when_traversing_in_preorder_when_the_tree_is_empty) {
traverse(NULL, visitor, PREORDER);
assert_that(visited_count, is_equal_to(0));
}
Ensure(BinaryTree,
when_traversing_in_preorder_when_the_tree_has_a_single_node) {
Node *node = initialize(100);
traverse(node, visitor, PREORDER);
assert_that(visited_count, is_equal_to(1));
assert_that(visited[0], is_equal_to(100));
destroy(node);
}
Ensure(BinaryTree, when_traversing_in_preorder_when_the_tree_has_a_left_node) {
Node *node = initialize(100);
node->left = initialize(200);
traverse(node, visitor, PREORDER);
assert_that(visited_count, is_equal_to(2));
assert_that(visited[0], is_equal_to(100));
assert_that(visited[1], is_equal_to(200));
destroy(node);
}
Ensure(BinaryTree, when_traversing_in_preorder_when_the_tree_has_a_right_node) {
Node *node = initialize(100);
node->right = initialize(300);
traverse(node, visitor, PREORDER);
assert_that(visited_count, is_equal_to(2));
assert_that(visited[0], is_equal_to(100));
assert_that(visited[1], is_equal_to(300));
destroy(node);
}
Ensure(BinaryTree,
when_traversing_in_preorder_when_the_tree_has_a_left_and_right_node) {
Node *node = initialize(100);
node->left = initialize(200);
node->right = initialize(300);
traverse(node, visitor, PREORDER);
assert_that(visited_count, is_equal_to(3));
assert_that(visited[0], is_equal_to(100));
assert_that(visited[1], is_equal_to(200));
assert_that(visited[2], is_equal_to(300));
destroy(node);
}
Ensure(BinaryTree,
when_traversing_in_preorder_when_the_tree_has_multiple_levels) {
Node *node = initialize(100);
node->left = initialize(200);
node->right = initialize(300);
node->left->left = initialize(400);
node->left->right = initialize(500);
traverse(node, visitor, PREORDER);
assert_that(visited_count, is_equal_to(5));
assert_that(visited[0], is_equal_to(100));
assert_that(visited[1], is_equal_to(200));
assert_that(visited[2], is_equal_to(400));
assert_that(visited[3], is_equal_to(500));
assert_that(visited[4], is_equal_to(300));
destroy(node);
}
Ensure(BinaryTree, when_traversing_in_postorder_when_the_tree_is_empty) {
traverse(NULL, visitor, POSTORDER);
assert_that(visited_count, is_equal_to(0));
}
Ensure(BinaryTree,
when_traversing_in_postorder_when_the_tree_has_a_single_node) {
Node *node = initialize(100);
traverse(node, visitor, POSTORDER);
assert_that(visited_count, is_equal_to(1));
assert_that(visited[0], is_equal_to(100));
destroy(node);
}
Ensure(BinaryTree, when_traversing_in_postorder_when_the_tree_has_a_left_node) {
Node *node = initialize(100);
node->left = initialize(200);
traverse(node, visitor, POSTORDER);
assert_that(visited_count, is_equal_to(2));
assert_that(visited[0], is_equal_to(200));
assert_that(visited[1], is_equal_to(100));
destroy(node);
}
Ensure(BinaryTree,
when_traversing_in_postorder_when_the_tree_has_a_right_node) {
Node *node = initialize(100);
node->right = initialize(300);
traverse(node, visitor, POSTORDER);
assert_that(visited_count, is_equal_to(2));
assert_that(visited[0], is_equal_to(300));
assert_that(visited[1], is_equal_to(100));
destroy(node);
}
Ensure(BinaryTree,
when_traversing_in_postorder_when_the_tree_has_a_left_and_right_node) {
Node *node = initialize(100);
node->left = initialize(200);
node->right = initialize(300);
traverse(node, visitor, POSTORDER);
assert_that(visited_count, is_equal_to(3));
assert_that(visited[0], is_equal_to(200));
assert_that(visited[1], is_equal_to(300));
assert_that(visited[2], is_equal_to(100));
destroy(node);
}
Ensure(BinaryTree,
when_traversing_in_postorder_when_the_tree_has_multiple_levels) {
Node *node = initialize(100);
node->left = initialize(200);
node->right = initialize(300);
node->left->left = initialize(400);
node->left->right = initialize(500);
traverse(node, visitor, POSTORDER);
assert_that(visited_count, is_equal_to(5));
assert_that(visited[0], is_equal_to(400));
assert_that(visited[1], is_equal_to(500));
assert_that(visited[2], is_equal_to(200));
assert_that(visited[3], is_equal_to(300));
assert_that(visited[4], is_equal_to(100));
destroy(node);
}
Ensure(BinaryTree, when_traversing_inorder_when_the_tree_is_empty) {
traverse(NULL, visitor, INORDER);
assert_that(visited_count, is_equal_to(0));
}
Ensure(BinaryTree, when_traversing_inorder_when_the_tree_has_a_single_node) {
Node *node = initialize(100);
traverse(node, visitor, INORDER);
assert_that(visited_count, is_equal_to(1));
assert_that(visited[0], is_equal_to(100));
destroy(node);
}
Ensure(BinaryTree, when_traversing_inorder_when_the_tree_has_a_left_node) {
Node *node = initialize(100);
node->left = initialize(200);
traverse(node, visitor, INORDER);
assert_that(visited_count, is_equal_to(2));
assert_that(visited[0], is_equal_to(200));
assert_that(visited[1], is_equal_to(100));
destroy(node);
}
Ensure(BinaryTree, when_traversing_inorder_when_the_tree_has_a_right_node) {
Node *node = initialize(100);
node->right = initialize(300);
traverse(node, visitor, INORDER);
assert_that(visited_count, is_equal_to(2));
assert_that(visited[0], is_equal_to(100));
assert_that(visited[1], is_equal_to(300));
destroy(node);
}
Ensure(BinaryTree,
when_traversing_inorder_when_the_tree_has_a_left_and_right_node) {
Node *node = initialize(100);
node->left = initialize(200);
node->right = initialize(300);
traverse(node, visitor, INORDER);
assert_that(visited_count, is_equal_to(3));
assert_that(visited[0], is_equal_to(200));
assert_that(visited[1], is_equal_to(100));
assert_that(visited[2], is_equal_to(300));
destroy(node);
}
Ensure(BinaryTree, when_traversing_inorder_when_the_tree_has_multiple_levels) {
Node *node = initialize(100);
node->left = initialize(200);
node->right = initialize(300);
node->left->left = initialize(400);
node->left->right = initialize(500);
traverse(node, visitor, INORDER);
assert_that(visited_count, is_equal_to(5));
assert_that(visited[0], is_equal_to(400));
assert_that(visited[1], is_equal_to(200));
assert_that(visited[2], is_equal_to(500));
assert_that(visited[3], is_equal_to(100));
assert_that(visited[4], is_equal_to(300));
destroy(node);
}
TestSuite *binary_tree_tests() {
TestSuite *suite = create_test_suite();
add_test_with_context(suite, BinaryTree,
when_traversing_in_preorder_when_the_tree_is_empty);
add_test_with_context(
suite, BinaryTree,
when_traversing_in_preorder_when_the_tree_has_a_single_node);
add_test_with_context(
suite, BinaryTree,
when_traversing_in_preorder_when_the_tree_has_a_left_node);
add_test_with_context(
suite, BinaryTree,
when_traversing_in_preorder_when_the_tree_has_a_right_node);
add_test_with_context(
suite, BinaryTree,
when_traversing_in_preorder_when_the_tree_has_a_left_and_right_node);
add_test_with_context(
suite, BinaryTree,
when_traversing_in_preorder_when_the_tree_has_multiple_levels);
add_test_with_context(suite, BinaryTree,
when_traversing_in_postorder_when_the_tree_is_empty);
add_test_with_context(
suite, BinaryTree,
when_traversing_in_postorder_when_the_tree_has_a_single_node);
add_test_with_context(
suite, BinaryTree,
when_traversing_in_postorder_when_the_tree_has_a_left_node);
add_test_with_context(
suite, BinaryTree,
when_traversing_in_postorder_when_the_tree_has_a_right_node);
add_test_with_context(
suite, BinaryTree,
when_traversing_in_postorder_when_the_tree_has_a_left_and_right_node);
add_test_with_context(
suite, BinaryTree,
when_traversing_in_postorder_when_the_tree_has_multiple_levels);
add_test_with_context(suite, BinaryTree,
when_traversing_inorder_when_the_tree_is_empty);
add_test_with_context(
suite, BinaryTree,
when_traversing_inorder_when_the_tree_has_a_single_node);
add_test_with_context(suite, BinaryTree,
when_traversing_inorder_when_the_tree_has_a_left_node);
add_test_with_context(suite, BinaryTree,
when_traversing_inorder_when_the_tree_has_a_right_node);
add_test_with_context(
suite, BinaryTree,
when_traversing_inorder_when_the_tree_has_a_left_and_right_node);
add_test_with_context(
suite, BinaryTree,
when_traversing_inorder_when_the_tree_has_multiple_levels);
return suite;
}
int main(int argc, char **argv) {
TestSuite *suite = create_test_suite();
add_suite(suite, binary_tree_tests());
return run_test_suite(suite, create_text_reporter());
}
|
