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

inplemented nextTreeData

Browse Source
This commit is contained in:
pvtrx 2025-12-12 08:54:12 +01:00
parent 70119f897a
commit 321b9630cc
1 changed files with 27 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

27
bintree.c
View File

@ -56,7 +56,34 @@ TreeNode *addToTree(TreeNode *root, const void *data, size_t dataSize, CompareFc
// push the top node and push all its left nodes. // push the top node and push all its left nodes.
void *nextTreeData(TreeNode *root) void *nextTreeData(TreeNode *root)
{ {
/* Iterator state kept across calls (strtok-style). */
static StackNode *iterStack = NULL;
/* Starting a new traversal: reset stack and seed with root's left spine. */
if (root != NULL) {
clearStack(iterStack);
iterStack = NULL;
for (TreeNode *n = root; n != NULL; n = n->left) {
iterStack = push(iterStack, n);
}
}
/* No more elements. */
if (iterStack == NULL) {
return NULL;
}
/* Visit next node in-order. */
TreeNode *node = (TreeNode *)top(iterStack);
iterStack = pop(iterStack);
/* After visiting, push the left spine of the right subtree. */
for (TreeNode *n = node->right; n != NULL; n = n->left) {
iterStack = push(iterStack, n);
}
return node->data;
} }
// Releases all memory resources (including data copies). // Releases all memory resources (including data copies).