Doble-Spiel/bintree.c

#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "stack.h"
#include "bintree.h"

static StackNode *push_left(TreeNode *node, StackNode *stack);

int compareFct(const void *a, const void *b)
{
    int x = *((int *)a);
    int y = *((int *)b);
    if (x < y) return -1;
    if (x > y) return 1;
    return 0;
}

static TreeNode *create_node(const void *data, size_t data_size)
{
    TreeNode *node = malloc(sizeof(TreeNode));
    if (!node)
    {
        perror("Speicher wurde NICHT reserviert!");
        return NULL;
    }
    node->data = malloc(data_size);
    if (!node->data)
    {
        perror("Speicher wurde NICHT reserviert!");
        free(node);
        return NULL;
    }
    memcpy(node->data, data, data_size);
    node->left = NULL;
    node->right = NULL;
    return node;
}

TreeNode *addToTree(TreeNode *root, const void *data, size_t dataSize,
                    CompareFctType compareFct, int *isDuplicate)
{
    if (root == NULL)
    {
        if (isDuplicate) *isDuplicate = 0;
        return create_node(data, dataSize);
    }
    int cmp = compareFct(data, root->data);
    if (cmp < 0)
        root->left = addToTree(root->left, data, dataSize, compareFct, isDuplicate);
    else if (cmp > 0)
        root->right = addToTree(root->right, data, dataSize, compareFct, isDuplicate);
    else if (isDuplicate)
        *isDuplicate = 1;
    return root;
}

// nextTreeData benutzt jetzt einen extern verwalteten Stack
void *nextTreeData(TreeNode *root, StackNode **stack)
{
    if (root != NULL)
        *stack = push_left(root, *stack);

    if (*stack == NULL)
        return NULL;

    TreeNode *node = (TreeNode *)top(*stack);
    *stack = pop(*stack);

    if (node->right != NULL)
        *stack = push_left(node->right, *stack);

    return node->data;
}

static StackNode *push_left(TreeNode *node, StackNode *stack)
{
    while (node != NULL)
    {
        stack = push(stack, node);
        node = node->left;
    }
    return stack;
}

void clearTree(TreeNode *root)
{
    if (root == NULL)
        return;
    clearTree(root->left);
    clearTree(root->right);
    free(root->data);
    free(root);
}

unsigned int treeSize(const TreeNode *root)
{
    if (root == NULL)
        return 0;
    return 1 + treeSize(root->left) + treeSize(root->right);
}