bruennerda98937/info2_a3_Doble_BruenenrKob
1
0
Fork 0
generated from freudenreichan/info2Praktikum-DobleSpiel
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Add tests for nextTreeData functionality

Browse Source
This commit is contained in:
D2A62006 2025-12-08 17:49:18 +01:00
parent ea36ddeec2
commit 3cc67f0343
1 changed files with 136 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

137
bintreeTest.c
View File

@ -25,6 +25,7 @@ void tearDown(void){
//Use if needed
}
//addToTree()
void test_addToTree_singleElement(void){
int value = 42;
TreeNode *tree = NULL;
@ -104,6 +105,8 @@ void test_addToTree_withoutDuplicatesAccept(void){
TEST_ASSERT_EQUAL_INT(60, *(int *)tree->right->left->data);
TEST_ASSERT_EQUAL_INT(5, treeSize(tree));
}
//treeSize()
void test_treeSize_emptyTree(void){
TEST_ASSERT_EQUAL_UINT(0, treeSize(NULL));
@ -132,10 +135,137 @@ void test_treeSize_multipleNodes(void){
}
//nextTreeData()
void test_nextTreeData_emptyTree(void){
TEST_ASSERT_NULL(nextTreeData(NULL));
}
void test_nextTreeData_singleElement(void){
TreeNode *tree = NULL;
int value = 42;
tree = addToTree(tree, &value, sizeof(int), compareInts, NULL);
int *result = (int *)nextTreeData(tree);
TEST_ASSERT_NOT_NULL(result);
TEST_ASSERT_EQUAL_INT(value, *result);
TEST_ASSERT_NULL(nextTreeData(NULL));
clearTree(tree);
}
void test_nextTreeData_multipleElements(void){
TreeNode *tree = NULL;
int values[] = {20, 30, 40, 50, 60, 70, 80};
int expected[] = {20, 30, 40, 50, 60, 70, 80};
for(int i = 0; i < 7; i++){
tree = addToTree(tree, &values[i], sizeof(int), compareInts, NULL);
}
int *result = (int *)nextTreeData(tree);
TEST_ASSERT_NOT_NULL(result);
TEST_ASSERT_EQUAL_INT(expected[0], *result);
for(int i = 1; i < 7; i++){
result = (int *)nextTreeData(NULL);
TEST_ASSERT_NOT_NULL(result);
TEST_ASSERT_EQUAL_INT(expected[i], *result);
}
TEST_ASSERT_NULL(nextTreeData(NULL));
clearTree(tree);
}
void test_nextTreeData_multipleElements_optimized(void){
TreeNode *tree = NULL;
int values[] = {50, 30, 70, 20, 40, 60, 80};
int expected[] = {20, 30, 40, 50, 60, 70, 80};
for(int i = 0; i < 7; i++){
tree = addToTree(tree, &values[i], sizeof(int), compareInts, NULL);
}
int *result = (int *)nextTreeData(tree);
TEST_ASSERT_NOT_NULL(result);
TEST_ASSERT_EQUAL_INT(expected[0], *result);
for(int i = 1; i < 7; i++){
result = (int *)nextTreeData(NULL);
TEST_ASSERT_NOT_NULL(result);
TEST_ASSERT_EQUAL_INT(expected[i], *result);
}
TEST_ASSERT_NULL(nextTreeData(NULL));
clearTree(tree);
}
void test_nextTreeData_withDuplicates(void){
TreeNode *tree = NULL;
int values[] = {50, 30, 70, 20, 20, 60, 60};
int expected[] = {20, 20, 30, 50, 60, 60, 70};
for(int i = 0; i < 7; i++){
tree = addToTree(tree, &values[i], sizeof(int), compareInts, NULL);
}
int *result = (int *)nextTreeData(tree);
TEST_ASSERT_NOT_NULL(result);
TEST_ASSERT_EQUAL_INT(expected[0], *result);
for(int i = 1; i < 7; i++){
result = (int *)nextTreeData(NULL);
TEST_ASSERT_NOT_NULL(result);
TEST_ASSERT_EQUAL_INT(expected[i], *result);
}
TEST_ASSERT_NULL(nextTreeData(NULL));
}
void test_nextTreeData_restart(void){
TreeNode *tree = NULL;
int values[] = {50, 30, 70, 20, 40, 60, 80};
int expected[] = {20, 30, 40, 50, 60, 70, 80};
for(int i = 0; i < 7; i++){
tree = addToTree(tree, &values[i], sizeof(int), compareInts, NULL);
}
int *result = (int *)nextTreeData(tree);
TEST_ASSERT_NOT_NULL(result);
TEST_ASSERT_EQUAL_INT(expected[0], *result);
for(int i = 1; i < 4; i++){
result = (int *)nextTreeData(NULL);
TEST_ASSERT_NOT_NULL(result);
TEST_ASSERT_EQUAL_INT(expected[i], *result);
}
result = (int *)nextTreeData(tree);
TEST_ASSERT_NOT_NULL(result);
TEST_ASSERT_EQUAL_INT(expected[0], *result);
for(int i = 1; i < 7; i++){
result = (int *)nextTreeData(NULL);
TEST_ASSERT_NOT_NULL(result);
TEST_ASSERT_EQUAL_INT(expected[i], *result);
}
}
//clearTree()
void test_clearTree_emptyTree(void){
clearTree(NULL);
TEST_ASSERT_TRUE(1);
@ -164,6 +294,7 @@ void test_clearTree_multipleElements(void){
TEST_ASSERT_TRUE(1);
}
int main(){
UNITY_BEGIN();
@ -182,8 +313,12 @@ int main(){
RUN_TEST(test_treeSize_multipleNodes);
//nextTreeData()
RUN_TEST(test_nextTreeData_emptyTree);
RUN_TEST(test_nextTreeData_singleElement);
RUN_TEST(test_nextTreeData_multipleElements);
RUN_TEST(test_nextTreeData_multipleElements_optimized);
RUN_TEST(test_nextTreeData_withDuplicates);
RUN_TEST(test_nextTreeData_restart);
//clearTree()
RUN_TEST(test_clearTree_emptyTree);