tsafackre102662/Doble_Spiel
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

bintree is done and fixed

Browse Source
This commit is contained in:
regis37 2025-12-01 12:14:17 +01:00
parent fc63898359
commit dc7000015c
1 changed files with 0 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
bintree.c
View File

@ -51,7 +51,6 @@ TreeNode *addToTree(TreeNode *root, const void *data, size_t dataSize, CompareFc
return root; return root;
} }
// Iterates over the tree given by root. Follows the usage of strtok. If tree is NULL, the next entry of the last tree given is returned in ordering direction. // Iterates over the tree given by root. Follows the usage of strtok. If tree is NULL, the next entry of the last tree given is returned in ordering direction.
// Use your implementation of a stack to organize the iterator. Push the root node and all left nodes first. On returning the next element, // Use your implementation of a stack to organize the iterator. Push the root node and all left nodes first. On returning the next element,
// push the top node and push all its left nodes. // push the top node and push all its left nodes.
@ -90,7 +89,6 @@ void *nextTreeData(TreeNode *root) {
return node->data; return node->data;
} }
// Releases all memory resources (including data copies). // Releases all memory resources (including data copies).
void clearTree(TreeNode *root) { void clearTree(TreeNode *root) {
if (root == NULL) if (root == NULL)