hofmannjo99187/DobleSpiel
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

removed not needed comments

Browse Source
This commit is contained in:
Jonas Hofmann 2025-12-13 15:09:35 +01:00
parent d391d60597
commit a575259cac
1 changed files with 4 additions and 54 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

58
bintree.c
View File

@ -48,60 +48,10 @@ TreeNode *addToTree(TreeNode *root, const void *data, size_t dataSize, CompareFc
return addToTreeRec(root, newNode, compareFct, isDuplicate, 1); return addToTreeRec(root, newNode, compareFct, isDuplicate, 1);
} }
/*
TreeNode *addToTreeRec(TreeNode *currentNode, TreeNode *newNode, CompareFctType compareFct, int *isDuplicate, const int root)
{
/*if ((currentNode == NULL))
{
if ((isDuplicate == NULL) || root)
{
return newNode;
}
else
{
return currentNode;
}
}
// Mögliche Ergänzung --------------------------
if (currentNode == NULL)
{
if (isDuplicate != NULL)
*isDuplicate = 0;
return newNode;
}
//--------------------------------
else if ((compareFct(currentNode->data, newNode->data) < 0))
{
currentNode->left = addToTreeRec(currentNode->left, newNode, compareFct, isDuplicate, 0);
}
else if ((compareFct(currentNode->data, newNode->data) > 0))
{
currentNode->right = addToTreeRec(currentNode->right, newNode, compareFct, isDuplicate, 0);
}
else if ((compareFct(currentNode->data, newNode->data) == 0))
{
if (isDuplicate == NULL)
{
currentNode->left = addToTreeRec(currentNode->left, newNode, compareFct, isDuplicate, 0);
}
else
{
*isDuplicate = 1;
}
}
return currentNode;
} */
TreeNode *addToTreeRec(TreeNode *currentNode, TreeNode *newNode, CompareFctType compareFct, int *isDuplicate, const int root) TreeNode *addToTreeRec(TreeNode *currentNode, TreeNode *newNode, CompareFctType compareFct, int *isDuplicate, const int root)
{ {
if ((currentNode == NULL)) if (currentNode == NULL)
{ {
if ((isDuplicate == NULL) || root) if ((isDuplicate == NULL) || root)
{ {
@ -118,15 +68,15 @@ TreeNode *addToTreeRec(TreeNode *currentNode, TreeNode *newNode, CompareFctType
return currentNode; return currentNode;
} }
} }
else if ((compareFct(currentNode->data, newNode->data) < 0)) else if (compareFct(currentNode->data, newNode->data) < 0)
{ {
currentNode->left = addToTreeRec(currentNode->left, newNode, compareFct, isDuplicate, 0); currentNode->left = addToTreeRec(currentNode->left, newNode, compareFct, isDuplicate, 0);
} }
else if ((compareFct(currentNode->data, newNode->data) > 0)) else if (compareFct(currentNode->data, newNode->data) > 0)
{ {
currentNode->right = addToTreeRec(currentNode->right, newNode, compareFct, isDuplicate, 0); currentNode->right = addToTreeRec(currentNode->right, newNode, compareFct, isDuplicate, 0);
} }
else if ((compareFct(currentNode->data, newNode->data) == 0)) else if (compareFct(currentNode->data, newNode->data) == 0)
{ {
if (isDuplicate == NULL) if (isDuplicate == NULL)
{ {