gloecknerni100842/I2_Projects
2
2
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

small fix

Browse Source
This commit is contained in:
Jonas Urban 2025-12-11 11:08:42 +01:00
parent c3def11852
commit 4359714d09
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
I2_Dobble/bintreeTest.c
View File

@ -14,7 +14,7 @@ void test_addToTree_single_element(void)
{ {
TreeNode *root = NULL; TreeNode *root = NULL;
int value = 10; int value = 10;
int dup = -1; int dup;
root = addToTree(root, &value, sizeof(int), compare, &dup); root = addToTree(root, &value, sizeof(int), compare, &dup);
@ -29,7 +29,7 @@ void test_addToTree_multiple_elements_and_size(void)
{ {
TreeNode *root = NULL; TreeNode *root = NULL;
int values[] = {5, 3, 7, 1, 4}; int values[] = {5, 3, 7, 1, 4};
int dup = 0; int dup;
for (int i = 0; i < 5; i++) for (int i = 0; i < 5; i++)
root = addToTree(root, &values[i], sizeof(int), compare, &dup); root = addToTree(root, &values[i], sizeof(int), compare, &dup);
@ -91,7 +91,7 @@ void test_treeSize_returns_correct_size()
TreeNode *root = NULL; TreeNode *root = NULL;
int values[] = {8, 3, 10, 1, 6, 14}; int values[] = {8, 3, 10, 1, 6, 14};
// ersten Baum aufbauen //Baum aufbauen
for (int i = 0; i < 6; i++) for (int i = 0; i < 6; i++)
root = addToTree(root, &values[i], sizeof(int), compare, NULL); root = addToTree(root, &values[i], sizeof(int), compare, NULL);