feat(tree): initially working binary tree
This commit is contained in:
parent
2ecd2eae4d
commit
e88bfadf2c
4 changed files with 146 additions and 23 deletions
|
|
@ -17,16 +17,37 @@ void test_insert() {
|
|||
|
||||
for (uint64_t i = 0; i < 25; i++) {
|
||||
TEST_CHECK(vieter_tree_insert(tree, i, NULL) == vieter_tree_ok);
|
||||
TEST_SIZE(tree, i + 1);
|
||||
}
|
||||
|
||||
void *out;
|
||||
|
||||
for (uint64_t i = 0; i < 25; i++) {
|
||||
TEST_CHECK(vieter_tree_search(&out, tree, i) == vieter_tree_ok);
|
||||
TEST_CHECK(vieter_tree_insert(tree, i, NULL) == vieter_tree_already_present);
|
||||
TEST_CHECK(vieter_tree_search(&out, tree, i) == vieter_tree_ok);
|
||||
}
|
||||
}
|
||||
|
||||
void test_remove() {
|
||||
vieter_tree *tree = vieter_tree_init();
|
||||
|
||||
for (uint64_t i = 0; i < 25; i++) {
|
||||
TEST_CHECK(vieter_tree_insert(tree, i, NULL) == vieter_tree_ok);
|
||||
}
|
||||
|
||||
void *out;
|
||||
|
||||
for (uint64_t i = 0; i < 25; i++) {
|
||||
TEST_CHECK(vieter_tree_search(&out, tree, i) == vieter_tree_ok);
|
||||
TEST_CHECK(vieter_tree_remove(&out, tree, i) == vieter_tree_ok);
|
||||
TEST_CHECK(vieter_tree_search(&out, tree, i) == vieter_tree_not_present);
|
||||
}
|
||||
}
|
||||
|
||||
TEST_LIST = {
|
||||
{"test_init", test_init},
|
||||
{"test_insert", test_insert},
|
||||
{"test_remove", test_remove},
|
||||
{NULL, NULL}
|
||||
};
|
||||
|
|
|
|||
Reference in a new issue