hofmannjo99187/DobleSpiel
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

all binaryTree functions and Tests working

Browse Source
This commit is contained in:
Jonas Hofmann 2025-12-09 23:13:39 +01:00
parent ef3e0b7891
commit 6a9461bf5b
2 changed files with 8 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
bintree.c
View File

@ -9,7 +9,7 @@
/* * `addToTree`: fügt ein neues Element in den Baum ein (rekursiv), Done /* * `addToTree`: fügt ein neues Element in den Baum ein (rekursiv), Done
* `clearTree`: gibt den gesamten Baum frei (rekursiv), Done * `clearTree`: gibt den gesamten Baum frei (rekursiv), Done
* `treeSize`: zählt die Knoten im Baum (rekursiv), Done * `treeSize`: zählt die Knoten im Baum (rekursiv), Done
* `nextTreeData`: Traversierung mit Hilfe des zuvor implementierten Stacks. */ * `nextTreeData`: Traversierung mit Hilfe des zuvor implementierten Stacks. Done */
static TreeNode *root = NULL; static TreeNode *root = NULL;

9
bintreeTests.c
View File

@ -109,7 +109,6 @@ void test_nextTreeDataReturnsNextDataCorrectly(void)
testRoot = addToTree(testRoot, &score6, sizeof(int), compareIntEntries, NULL); testRoot = addToTree(testRoot, &score6, sizeof(int), compareIntEntries, NULL);
testRoot = addToTree(testRoot, &score7, sizeof(int), compareIntEntries, NULL); testRoot = addToTree(testRoot, &score7, sizeof(int), compareIntEntries, NULL);
// Create Stack // Create Stack
StackNode *entry = nextTreeData(testRoot); StackNode *entry = nextTreeData(testRoot);
@ -124,7 +123,7 @@ void test_nextTreeDataReturnsNextDataCorrectly(void)
TEST_ASSERT_EQUAL(score2, *(int *)nextTreeData(NULL)); TEST_ASSERT_EQUAL(score2, *(int *)nextTreeData(NULL));
TEST_ASSERT_EQUAL(score4, *(int *)nextTreeData(NULL)); TEST_ASSERT_EQUAL(score4, *(int *)nextTreeData(NULL));
clearStack(entry);
clearTree(testRoot); clearTree(testRoot);
} }
@ -214,10 +213,10 @@ int main()
UNITY_BEGIN(); UNITY_BEGIN();
printf("\n============================\nBinary Tree tests\n============================\n"); printf("\n============================\nBinary Tree tests\n============================\n");
// RUN_TEST(test_addToTreeExpandsTreeCorrectly); RUN_TEST(test_addToTreeExpandsTreeCorrectly);
RUN_TEST(test_nextTreeDataReturnsNextDataCorrectly); RUN_TEST(test_nextTreeDataReturnsNextDataCorrectly);
// RUN_TEST(test_clearTreeworksLikeExpected); RUN_TEST(test_clearTreeworksLikeExpected);
// RUN_TEST(test_treeSizeWorkingLikeExpected); RUN_TEST(test_treeSizeWorkingLikeExpected);
return UNITY_END(); return UNITY_END();
} }