kachelto100370/info2Praktikum-DobleSpiel
1
0
Fork 0
forked from freudenreichan/info2Praktikum-DobleSpiel
Code Pull Requests Activity

bintree unnötige funktion gelöscht

Browse Source
This commit is contained in:
Kristin 2025-12-12 11:10:42 +01:00
parent 9fb140fecf
commit 7683a157c9
1 changed files with 3 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
bintree.c
View File

@ -79,11 +79,8 @@ void *nextTreeData(TreeNode *root) {
TreeNode *currentNode = root; TreeNode *currentNode = root;
while (currentNode != while (currentNode !=
NULL) { // alle linken Knoten werden vom root an auf den Stack gelegt NULL) { // alle linken Knoten werden vom root an auf den Stack gelegt
StackNode *oldStack = stack;
StackNode *newStack = push(stack, currentNode); stack = push(stack, currentNode);
if (newStack == oldStack)
return NULL; // push fehlgeschlagen
stack = newStack;
currentNode = currentNode->left; currentNode = currentNode->left;
} }
} }
@ -98,11 +95,7 @@ void *nextTreeData(TreeNode *root) {
// Rechten Teilbaum pushen // Rechten Teilbaum pushen
TreeNode *currentNode = node->right; TreeNode *currentNode = node->right;
while (currentNode != NULL) { while (currentNode != NULL) {
StackNode *oldStack = stack; stack = push(stack, currentNode);
StackNode *newStack = push(stack, currentNode);
if (newStack == oldStack)
return NULL; // push fehlgeschlagen
stack = newStack;
currentNode = currentNode->left; currentNode = currentNode->left;
} }
return node->data; // Pointer auf Daten return node->data; // Pointer auf Daten