-
Notifications
You must be signed in to change notification settings - Fork 30
/
test_bstree.c
146 lines (127 loc) · 4.33 KB
/
test_bstree.c
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
#include "bstree.h"
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include "alloc-testing.h"
#include "test_helper.h"
typedef struct _CBValue {
void *data[100];
int index;
int length;
} CBValue;
static void bs_tree_traverse_callback(BSTreeNode *node, void *args)
{
CBValue *value = (CBValue *)args;
value->data[(value->index)++] = node->data;
}
// static void bs_tree_traverse_print(BSTreeNode *node, void *args)
// {
// printf("%d, ", *((int *)node->data));
// }
void test_bstree()
{
int entries[] = {38, 23, 42, 4, 16, 15, 8, 99, 50, 30};
int sorted[] = {4, 8, 15, 16, 23, 30, 38, 42, 50, 99};
int num_entries = sizeof(entries) / sizeof(int);
BSTree *tree = bs_tree_new(int_compare);
BSTreeNode *node;
for (int i = 0; i < num_entries; ++i) {
node = bs_tree_insert(tree, &entries[i]);
assert(int_equal(node->data, &entries[i]));
}
node = bs_tree_lookup_data(tree, &entries[3]);
assert(int_equal(node->data, &entries[3]));
CBValue cb;
cb.index = 0;
bs_tree_inorder_traverse(tree, bs_tree_traverse_callback, &cb);
assert(cb.index == 10);
for (int i = 0; i < num_entries; ++i) {
// printf("%d ", *(int *)cb.data[i]);
assert(int_equal(cb.data[i], &sorted[i]));
}
/**
38
/\
23 42
/\ /\
4 30 99
/\ /
16 50
/
15
/
8
*/
// 38, 23, 42, 4, 16, 15, 8, 99, 50, 30 => 4
node = bs_tree_remove_node(tree, bs_tree_lookup_data(tree, &entries[3]));
free(node);
// 38, 23, 42, 4, 16, 15, 8, 99, 50, 30 => 16
node = bs_tree_remove_node(tree, bs_tree_lookup_data(tree, &entries[4]));
free(node);
// 38, 23, 42, 4, 16, 15, 8, 99, 50, 30 => 38
node = bs_tree_remove_node(tree, bs_tree_lookup_data(tree, &entries[0]));
free(node);
// 8, 15, 23, 30, 42, 50, 99
int remain[] = {8, 15, 23, 30, 42, 50, 99};
cb.index = 0;
bs_tree_inorder_traverse(tree, bs_tree_traverse_callback, &cb);
// printf("len === %d = %d ===\n", cb.index, tree->num_nodes);
assert(cb.index == tree->num_nodes);
for (int i = 0; i < tree->num_nodes; ++i) {
// printf("%d ", *(int *)cb.data[i]);
assert(int_equal(cb.data[i], &remain[i]));
}
bs_tree_free(tree);
}
void test_bstree_remove()
{
int entries[] = {38, 23, 42, 4, 16, 15, 8, 99, 50, 30,
2, 1, 3, 20, 120, 40, 39, 41, 45, 60};
int num_entries = sizeof(entries) / sizeof(int);
BSTree *tree = bs_tree_new(int_compare);
BSTreeNode *node;
for (int i = 0; i < num_entries; ++i) {
node = bs_tree_insert(tree, &entries[i]);
assert(int_equal(node->data, &entries[i]));
}
// 38, 23, 42, 4, 16, 15, 8, 99, 50, 30, 2, 1, 3, 20, 120, 40, 39, 41, 45,
// 60 1, 2, 3, 4, 8, 15, 16, 20, 23, 30, 38, 39, 40, 41, 42, 45, 50, 60, 99,
// 120 bs_tree_inorder_traverse(tree, bs_tree_traverse_print, NULL);
// printf("\n==========\n");
/*
38
/\
23 42
/\ /\
4 30 40 99
/\ /\ /\
2 16 39 41 50 120
/\ /\ /\
1 3 15 20 45 60
/
8
*/
for (int i = 2; i < num_entries; i += 3) {
node =
bs_tree_remove_node(tree, bs_tree_lookup_data(tree, &entries[i]));
free(node);
}
// bs_tree_inorder_traverse(tree, bs_tree_traverse_print, NULL);
// printf("\n==========\n");
for (int i = 0; i < num_entries; i += 3) {
node =
bs_tree_remove_node(tree, bs_tree_lookup_data(tree, &entries[i]));
free(node);
}
// bs_tree_inorder_traverse(tree, bs_tree_traverse_print, NULL);
// printf("\n==========\n");
for (int i = 1; i < num_entries; i += 3) {
node =
bs_tree_remove_node(tree, bs_tree_lookup_data(tree, &entries[i]));
free(node);
}
// bs_tree_inorder_traverse(tree, bs_tree_traverse_print, NULL);
// printf("\n==========\n");
assert(tree->num_nodes == 0);
bs_tree_free(tree);
}