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
|
#include "meldable_heap.h"
#include <cgreen/cgreen.h>
#include <string.h>
Ensure(add_inserts_item_into_right_subtree) {
MeldableHeap *heap = meldable_heap_initialize(5);
heap = meldable_heap_add(heap, 3);
assert_that(heap->value, is_equal_to(3));
assert_that(heap->right->value, is_equal_to(5));
}
Ensure(add_inserts_item_into_left_subtree) {
MeldableHeap *heap = meldable_heap_initialize(5);
heap = meldable_heap_add(heap, 8);
assert_that(heap->value, is_equal_to(5));
assert_that(heap->right->value, is_equal_to(8));
}
/*
(1)
/ \
(3) (2)
/ \ / \
(10) (6) (7) (4)
/ \ /
(9) (8)(5)
*/
Ensure(add_inserts_multiple_items_into_the_subtree) {
MeldableHeap *heap = NULL;
for (int i = 1; i <= 10; ++i)
heap = meldable_heap_add(heap, i);
assert_that(heap->value, is_equal_to(1));
assert_that(heap->right->value, is_equal_to(2));
assert_that(heap->right->right->value, is_equal_to(4));
assert_that(heap->right->right->left->value, is_equal_to(5));
assert_that(heap->right->left->value, is_equal_to(7));
assert_that(heap->right->left->left->value, is_equal_to(9));
assert_that(heap->right->left->right->value, is_equal_to(8));
assert_that(heap->left->value, is_equal_to(3));
assert_that(heap->left->left->value, is_equal_to(10));
assert_that(heap->left->right->value, is_equal_to(6));
}
/*
(1)
/ \
(3) (2)
/ \ / \
(10) (6) (7) (4)
/ \ /
(9) (8)(5)
to
(1)
/ \
(3) (2)
/ \ / \
(10) (6) (4)
/ \ /
(9) (8)(5)
*/
Ensure(remove_removes_the_node_from_the_tree) {
MeldableHeap *heap = NULL;
for (int i = 1; i <= 10; ++i)
heap = meldable_heap_add(heap, i);
meldable_heap_remove(heap->right->left);
assert_that(heap->value, is_equal_to(1));
assert_that(heap->right->value, is_equal_to(2));
assert_that(heap->right->right->value, is_equal_to(4));
assert_that(heap->right->right->left->value, is_equal_to(5));
assert_that(heap->right->left->value, is_equal_to(8));
assert_that(heap->right->left->left->value, is_equal_to(9));
assert_that(heap->right->left->right, is_equal_to(NULL));
assert_that(heap->left->value, is_equal_to(3));
assert_that(heap->left->left->value, is_equal_to(10));
assert_that(heap->left->right->value, is_equal_to(6));
}
TestSuite *meldable_heap_tests() {
TestSuite *x = create_test_suite();
add_test(x, add_inserts_item_into_right_subtree);
add_test(x, add_inserts_item_into_left_subtree);
add_test(x, add_inserts_multiple_items_into_the_subtree);
add_test(x, remove_removes_the_node_from_the_tree);
return x;
}
|
