#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(data!= NULL && dataSize > 0)
      {
        if(root == NULL)      //Abbruchbedingung: Keine Wurzel vorhanden, deshalb fügen wir hier einen neuen Knote ein
          {
          TreeNode *newNode = (TreeNode *)malloc(sizeof(TreeNode));
          if(newNode == NULL)
            {
            return NULL;
            }
          newNode->data = malloc(dataSize);
          if(newNode->data == NULL)
            {
            free(newNode);
            return NULL;
            }
          memcpy(newNode->data, data, dataSize);
          newNode->left = NULL;
          newNode->right = NULL;

          if(isDuplicate!= NULL)
            {
              *isDuplicate = 0;
            }

          return newNode;
          }
        int cmp = compareFct(root->data, 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;
            }
            else {
              // isDuplicate == NULL → trotzdem ein Duplikat einfügen (z.B. rechts)
              root->right = addToTree(root->right, data, dataSize, compareFct, NULL);
            }
          }
          return root;
      }
    return NULL;
}

// 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)
{

}

// Releases all memory resources (including data copies).
void clearTree(TreeNode *root)
{
  

}

// Returns the number of entries in the tree given by root.
unsigned int treeSize(const TreeNode *root)
{

}