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

changes bintree.c

Browse Source
This commit is contained in:
Maximilian Ott 2025-12-16 09:05:54 +01:00
parent 0dd1564ba5
commit da4ea358a3
1 changed files with 12 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
bintree.c
View File

@ -7,6 +7,7 @@
static StackNode *push_left(TreeNode *node, StackNode *stack); static StackNode *push_left(TreeNode *node, StackNode *stack);
/* Vergleichsfunktion */
int compareFct(const void *argument1, const void *argument2) int compareFct(const void *argument1, const void *argument2)
{ {
int x = *((int *)argument1); int x = *((int *)argument1);
@ -19,6 +20,7 @@ int compareFct(const void *argument1, const void *argument2)
return 0; return 0;
} }
/* Erzeugt einen neuen Baumknoten mit Kopie der Daten */
static TreeNode *create_node(const void *data, size_t data_size) static TreeNode *create_node(const void *data, size_t data_size)
{ {
TreeNode *node = malloc(sizeof(TreeNode)); TreeNode *node = malloc(sizeof(TreeNode));
@ -43,6 +45,7 @@ static TreeNode *create_node(const void *data, size_t data_size)
return node; return node;
} }
/* Fügt ein Element in den Baum ein */
TreeNode *addToTree(TreeNode *root, const void *data, size_t dataSize, TreeNode *addToTree(TreeNode *root, const void *data, size_t dataSize,
CompareFctType compareFct, int *isDuplicate) CompareFctType compareFct, int *isDuplicate)
{ {
@ -72,29 +75,34 @@ TreeNode *addToTree(TreeNode *root, const void *data, size_t dataSize,
return root; return root;
} }
/* Iterator über den Baum (Inorder-Traversierung) */
void *nextTreeData(TreeNode *root) void *nextTreeData(TreeNode *root)
{ {
static StackNode *stack = NULL; static StackNode *stack = NULL;
/* Neuer Baum → Stack initialisieren */
if (root != NULL) if (root != NULL)
stack = push_left(root, stack); stack = push_left(root, stack);
if (stack == NULL) if (stack == NULL)
return NULL; return NULL;
/* Top-Element vom Stack holen */
StackNode *sn = pop(&stack); StackNode *sn = pop(&stack);
if (sn == NULL) if (sn == NULL)
return NULL; return NULL;
TreeNode *node = sn->data; TreeNode *node = (TreeNode *)sn->data;
free(sn); free(sn); // WICHTIG: pop gibt StackNode zurück → hier freigeben
/* Rechten Teilbaum vorbereiten */
if (node->right != NULL) if (node->right != NULL)
stack = push_left(node->right, stack); stack = push_left(node->right, stack);
return node->data; return node->data;
} }
/* Hilfsfunktion: alle linken Knoten auf den Stack legen */
static StackNode *push_left(TreeNode *node, StackNode *stack) static StackNode *push_left(TreeNode *node, StackNode *stack)
{ {
while (node != NULL) while (node != NULL)
@ -105,6 +113,7 @@ static StackNode *push_left(TreeNode *node, StackNode *stack)
return stack; return stack;
} }
/* Gibt den gesamten Baum frei */
void clearTree(TreeNode *root) void clearTree(TreeNode *root)
{ {
if (root == NULL) if (root == NULL)
@ -116,6 +125,7 @@ void clearTree(TreeNode *root)
free(root); free(root);
} }
/* Liefert die Anzahl der Knoten im Baum */
unsigned int treeSize(const TreeNode *root) unsigned int treeSize(const TreeNode *root)
{ {
if (root == NULL) if (root == NULL)