generated from freudenreichan/info2Praktikum-DobleSpiel
98 lines
2.7 KiB
C
98 lines
2.7 KiB
C
#include <string.h>
|
|
#include "stack.h"
|
|
#include "bintree.h"
|
|
|
|
//TODO: binären Suchbaum implementieren
|
|
/* * `addToTree`: fügt ein neues Element in den Baum ein (rekursiv),
|
|
* `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)
|
|
{
|
|
if(!root)
|
|
{
|
|
root = malloc(sizeof(node));
|
|
*node newNode;
|
|
*newNode.data = malloc(dataSize);
|
|
strcpy(*newNode.data, data);
|
|
*newNode.left = NULL;
|
|
*newNode.right = NULL;
|
|
if(isDuplicate)
|
|
*isDuplicate = 0;
|
|
return newNode;
|
|
}
|
|
if(compareFct(*data, *root->data) > 0)
|
|
{
|
|
*right = addToTree(right, data, dataSize, compareFct, isDuplicate);
|
|
}
|
|
else if(compareFct(*data, *root->data) < 0)
|
|
{
|
|
*left = addToTree(right, data, dataSize, compareFct, isDuplicate);
|
|
}
|
|
else
|
|
{
|
|
if(!isDuplicate)
|
|
*left = addToTree(right, data, dataSize, compareFct, isDuplicate);
|
|
else
|
|
{
|
|
*isDuplicate = 1;
|
|
}
|
|
}
|
|
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.
|
|
// Use your implementation of a stack to organize the iterator. Push the root node and all left nodes first. On returning the next element,
|
|
// push the top node and push all its left nodes.
|
|
void *nextTreeData(TreeNode *root)
|
|
{
|
|
StackNode *stackRoot = NULL;//Generates a new, empty stack
|
|
stackRoot = iterateThroughTree(root, stackRoot); //Fills the stack via the helping function iterateThroughTree
|
|
stackNode * tempBuffer = pop(stackRoot);
|
|
clearStack(stackRoot);
|
|
return tempBuffer;
|
|
}
|
|
|
|
//Function to aid nextTreeData
|
|
StackNode *iterateThroughTree(TreeNode *root, StackNode *stackRoot)
|
|
{
|
|
if(!root)
|
|
{
|
|
return stackRoot;
|
|
}
|
|
stackRoot = iterateThroughTree(root->left, stackRoot);
|
|
stackNode = push(stackNode, root->data);
|
|
stackRoot = iterateThroughTree(root->right, stackRoot);
|
|
return stackRoot;
|
|
}
|
|
|
|
// Releases all memory resources (including data copies).
|
|
void clearTree(TreeNode *root)
|
|
{
|
|
if(left)
|
|
clearTree(left);
|
|
if(right)
|
|
clearTree(right);
|
|
free(data);
|
|
data = NULL;
|
|
free(root);
|
|
root = NULL;
|
|
}
|
|
|
|
// Returns the number of entries in the tree given by root.
|
|
unsigned int treeSize(const TreeNode *root)
|
|
{
|
|
if(root)
|
|
{
|
|
unsigned int tempSize = 0;
|
|
if(left)
|
|
tempSize += treeSize(left);
|
|
if(right)
|
|
tempSize += treeSize(right);
|
|
return tempSize + 1;
|
|
}
|
|
return 0;
|
|
} |