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

fertiges Spiel ohne einbindung vom Binaerbaum mit Nicole und Lena

Browse Source
This commit is contained in:
Jakob Hofmann 2025-12-14 16:09:11 +01:00
commit f75a452daf
1 changed files with 2 additions and 88 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

90
bintree.c
View File

@ -18,50 +18,7 @@ count - number of bytes to copy
*/ */
TreeNode *addToTree(TreeNode *root, const void *data, size_t dataSize, CompareFctType compareFct, int *isDuplicate) TreeNode *addToTree(TreeNode *root, const void *data, size_t dataSize, CompareFctType compareFct, int *isDuplicate)
{ {
if (root == NULL)
{
TreeNode *newtreenode = malloc(sizeof(TreeNode));
if (newtreenode != NULL)
{
newtreenode->data = malloc(dataSize);
if (newtreenode->data == NULL)
{
free(newtreenode);
return NULL;
}
memcpy(newtreenode->data, data, dataSize);
newtreenode->left = NULL;
newtreenode->right = NULL;
if (isDuplicate != NULL)
{
*isDuplicate = 0;
}
}
return newtreenode;
}
int compare_value = compareFct(data, root->data); // wie funktioniert comparefcttype funktion? bzw wo steht diese?
if (compare_value == 0 && isDuplicate != NULL)
{
*isDuplicate = 1;
return root;
}
if (compare_value < 0)
{
root->left = addToTree(root->left, data, dataSize, compareFct, isDuplicate);
}
else
{
root->right = addToTree(root->right, data, dataSize, compareFct, isDuplicate);
}
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.
@ -69,60 +26,17 @@ 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)
{ {
static StackNode *stack = NULL;
TreeNode *currentElement = root;
if (currentElement != NULL)
{
clearStack(stack);
stack = NULL;
while (currentElement != NULL)
{
stack = push(stack, currentElement);
currentElement = currentElement->left;
}
}
if (stack == NULL)
{
return NULL;
}
TreeNode *node = (TreeNode *)top(stack);
stack = pop(stack);
currentElement = node->right;
while (currentElement != NULL)
{
stack = push(stack, currentElement);
currentElement = currentElement->left;
}
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)
{
clearTree(root->left);
clearTree(root->right);
free(root->data);
free(root);
}
} }
// Returns the number of entries in the tree given by root. // Returns the number of entries in the tree given by root.
unsigned int treeSize(const TreeNode *root) unsigned int treeSize(const TreeNode *root)
{ {
unsigned int count = 0;
if (root != NULL)
{
count = 1;
count += treeSize(root->right);
count += treeSize(root->left);
}
return count;
} }