From fab92499fa9e912b324b727ab1b03ecd0dfab537 Mon Sep 17 00:00:00 2001 From: Alex Reece Date: Thu, 12 Nov 2026 15:38:28 +0100 Subject: [PATCH] addToTree implemented --- Startcode/bintree.c | 14 +++++++++++++- 1 file changed, 13 insertions(+), 1 deletion(-) diff --git a/Startcode/bintree.c b/Startcode/bintree.c index 75f8c8f..3185307 100644 --- a/Startcode/bintree.c +++ b/Startcode/bintree.c @@ -7,11 +7,23 @@ * `clearTree`: gibt den gesamten Baum frei (rekursiv), * `treeSize`: zählt die Knoten im Baum (rekursiv), * `nextTreeData`: Traversierung mit Hilfe des zuvor implementierten Stacks. */ - // Adds a copy of data's pointer destination to the tree using compareFct for ordering. Accepts duplicates // if isDuplicate is NULL, otherwise ignores duplicates and sets isDuplicate to 1 (or to 0 if a new entry is added). TreeNode *addToTree(TreeNode *root, const void *data, size_t dataSize, CompareFctType compareFct, int *isDuplicate) { + // create new node + TreeNode* newNode = (TreeNode *)calloc(1, sizeof(TreeNode)); + newNode->data = calloc(1, dataSize); + memcpy(newNode->data, data, dataSize); + + if (root == NULL) return newNode; + if (compareFct(data, root->data)) { + root->left = addToTree(root->left, data, dataSize, compareFct, isDuplicate); + } else if (compareFct(root->data, data)) { + root->right = addToTree(root->right, data, dataSize, compareFct, isDuplicate); + } + return root; + }