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
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
|
use strict;
use warnings;
use FindBin;
use File::Spec::Functions;
use Test::More;
use Test::Exception;
use Class::MOP;
use lib catdir($FindBin::Bin, 'lib');
## ----------------------------------------------------------------------------
## These are all tests which are derived from the Tree::Binary test suite
## ----------------------------------------------------------------------------
ok(!Class::MOP::is_class_loaded('BinaryTree'), '... the binary tree class is not loaded');
lives_ok {
Class::MOP::load_class('BinaryTree');
} '... loaded the BinaryTree class without dying';
ok(Class::MOP::is_class_loaded('BinaryTree'), '... the binary tree class is now loaded');
## ----------------------------------------------------------------------------
## t/10_Tree_Binary_test.t
can_ok("BinaryTree", 'new');
can_ok("BinaryTree", 'setLeft');
can_ok("BinaryTree", 'setRight');
my $btree = BinaryTree->new("/")
->setLeft(
BinaryTree->new("+")
->setLeft(
BinaryTree->new("2")
)
->setRight(
BinaryTree->new("2")
)
)
->setRight(
BinaryTree->new("*")
->setLeft(
BinaryTree->new("4")
)
->setRight(
BinaryTree->new("5")
)
);
isa_ok($btree, 'BinaryTree');
## informational methods
can_ok($btree, 'isRoot');
ok($btree->isRoot(), '... this is the root');
can_ok($btree, 'isLeaf');
ok(!$btree->isLeaf(), '... this is not a leaf node');
ok($btree->getLeft()->getLeft()->isLeaf(), '... this is a leaf node');
can_ok($btree, 'hasLeft');
ok($btree->hasLeft(), '... this has a left node');
can_ok($btree, 'hasRight');
ok($btree->hasRight(), '... this has a right node');
## accessors
can_ok($btree, 'getUID');
{
my $UID = $btree->getUID();
is(("$btree" =~ /\((.*?)\)$/)[0], $UID, '... our UID is derived from the stringified object');
}
can_ok($btree, 'getNodeValue');
is($btree->getNodeValue(), '/', '... got what we expected');
{
can_ok($btree, 'getLeft');
my $left = $btree->getLeft();
isa_ok($left, 'BinaryTree');
is($left->getNodeValue(), '+', '... got what we expected');
can_ok($left, 'getParent');
my $parent = $left->getParent();
isa_ok($parent, 'BinaryTree');
is($parent, $btree, '.. got what we expected');
}
{
can_ok($btree, 'getRight');
my $right = $btree->getRight();
isa_ok($right, 'BinaryTree');
is($right->getNodeValue(), '*', '... got what we expected');
can_ok($right, 'getParent');
my $parent = $right->getParent();
isa_ok($parent, 'BinaryTree');
is($parent, $btree, '.. got what we expected');
}
## mutators
can_ok($btree, 'setUID');
$btree->setUID("Our UID for this tree");
is($btree->getUID(), 'Our UID for this tree', '... our UID is not what we expected');
can_ok($btree, 'setNodeValue');
$btree->setNodeValue('*');
is($btree->getNodeValue(), '*', '... got what we expected');
{
can_ok($btree, 'removeLeft');
my $left = $btree->removeLeft();
isa_ok($left, 'BinaryTree');
ok(!$btree->hasLeft(), '... we dont have a left node anymore');
ok(!$btree->isLeaf(), '... and we are not a leaf node');
$btree->setLeft($left);
ok($btree->hasLeft(), '... we have our left node again');
is($btree->getLeft(), $left, '... and it is what we told it to be');
}
{
# remove left leaf
my $left_leaf = $btree->getLeft()->removeLeft();
isa_ok($left_leaf, 'BinaryTree');
ok($left_leaf->isLeaf(), '... our left leaf is a leaf');
ok(!$btree->getLeft()->hasLeft(), '... we dont have a left leaf node anymore');
$btree->getLeft()->setLeft($left_leaf);
ok($btree->getLeft()->hasLeft(), '... we have our left leaf node again');
is($btree->getLeft()->getLeft(), $left_leaf, '... and it is what we told it to be');
}
{
can_ok($btree, 'removeRight');
my $right = $btree->removeRight();
isa_ok($right, 'BinaryTree');
ok(!$btree->hasRight(), '... we dont have a right node anymore');
ok(!$btree->isLeaf(), '... and we are not a leaf node');
$btree->setRight($right);
ok($btree->hasRight(), '... we have our right node again');
is($btree->getRight(), $right, '... and it is what we told it to be')
}
{
# remove right leaf
my $right_leaf = $btree->getRight()->removeRight();
isa_ok($right_leaf, 'BinaryTree');
ok($right_leaf->isLeaf(), '... our right leaf is a leaf');
ok(!$btree->getRight()->hasRight(), '... we dont have a right leaf node anymore');
$btree->getRight()->setRight($right_leaf);
ok($btree->getRight()->hasRight(), '... we have our right leaf node again');
is($btree->getRight()->getRight(), $right_leaf, '... and it is what we told it to be');
}
# some of the recursive informational methods
{
my $btree = BinaryTree->new("o")
->setLeft(
BinaryTree->new("o")
->setLeft(
BinaryTree->new("o")
)
->setRight(
BinaryTree->new("o")
->setLeft(
BinaryTree->new("o")
->setLeft(
BinaryTree->new("o")
->setRight(BinaryTree->new("o"))
)
)
)
)
->setRight(
BinaryTree->new("o")
->setLeft(
BinaryTree->new("o")
->setRight(
BinaryTree->new("o")
->setLeft(
BinaryTree->new("o")
)
->setRight(
BinaryTree->new("o")
)
)
)
->setRight(
BinaryTree->new("o")
->setRight(BinaryTree->new("o"))
)
);
isa_ok($btree, 'BinaryTree');
can_ok($btree, 'size');
cmp_ok($btree->size(), '==', 14, '... we have 14 nodes in the tree');
can_ok($btree, 'height');
cmp_ok($btree->height(), '==', 6, '... the tree is 6 nodes tall');
}
## ----------------------------------------------------------------------------
## t/13_Tree_Binary_mirror_test.t
sub inOrderTraverse {
my $tree = shift;
my @results;
my $_inOrderTraverse = sub {
my ($tree, $traversal_function) = @_;
$traversal_function->($tree->getLeft(), $traversal_function) if $tree->hasLeft();
push @results => $tree->getNodeValue();
$traversal_function->($tree->getRight(), $traversal_function) if $tree->hasRight();
};
$_inOrderTraverse->($tree, $_inOrderTraverse);
@results;
}
# test it on a simple well balanaced tree
{
my $btree = BinaryTree->new(4)
->setLeft(
BinaryTree->new(2)
->setLeft(
BinaryTree->new(1)
)
->setRight(
BinaryTree->new(3)
)
)
->setRight(
BinaryTree->new(6)
->setLeft(
BinaryTree->new(5)
)
->setRight(
BinaryTree->new(7)
)
);
isa_ok($btree, 'BinaryTree');
is_deeply(
[ inOrderTraverse($btree) ],
[ 1 .. 7 ],
'... check that our tree starts out correctly');
can_ok($btree, 'mirror');
$btree->mirror();
is_deeply(
[ inOrderTraverse($btree) ],
[ reverse(1 .. 7) ],
'... check that our tree ends up correctly');
}
# test is on a more chaotic tree
{
my $btree = BinaryTree->new(4)
->setLeft(
BinaryTree->new(20)
->setLeft(
BinaryTree->new(1)
->setRight(
BinaryTree->new(10)
->setLeft(
BinaryTree->new(5)
)
)
)
->setRight(
BinaryTree->new(3)
)
)
->setRight(
BinaryTree->new(6)
->setLeft(
BinaryTree->new(5)
->setRight(
BinaryTree->new(7)
->setLeft(
BinaryTree->new(90)
)
->setRight(
BinaryTree->new(91)
)
)
)
);
isa_ok($btree, 'BinaryTree');
my @results = inOrderTraverse($btree);
$btree->mirror();
is_deeply(
[ inOrderTraverse($btree) ],
[ reverse(@results) ],
'... this should be the reverse of the original');
}
done_testing;
|
