fertig

bintree.c

@@ -98,32 +98,3 @@ void *nextTreeData(TreeNode *root)
     current = node->right;
     return node->data;
 }
-
-// --------------------------
-// Zusätzliche Hilfsfunktion contains für numbers.c
-// --------------------------
-int contains(TreeNode *root, unsigned int value)
-{
-    if (!root) return 0;
-    unsigned int nodeValue = *(unsigned int *)root->data;
-    if (value == nodeValue) return 1;
-    if (value < nodeValue) return contains(root->left, value);
-    return contains(root->right, value);
-}
-
-// --------------------------
-// Hilfsfunktion insert für numbers.c
-// --------------------------
-TreeNode* insert(TreeNode *root, unsigned int value)
-{
-    int isDup = 0;
-    return addToTree(root, &value, sizeof(unsigned int), compareUint, &isDup);
-}
-
-// --------------------------
-// Hilfsfunktion freeTree für numbers.c
-// --------------------------
-void freeTree(TreeNode *root)
-{
-    clearTree(root);
-}

highscores.txt

@@ -1,10 +1,4 @@
-player_name1;19827
-player_name3;6985
-jannik;5979
-jannik;4991
-jannik;4980
-player1;3999
-player_name;3995
-player_name2;3994
-player_name1;3993
-player_name3;3990
+neuerspieler3;7946
+neuerspieler4;4991
+neuerspieler1;4989
+neuerspieler2;4988