bintree.c

@@ -26,7 +26,7 @@ TreeNode *addToTree(TreeNode *root, const void *data, size_t dataSize, CompareFc
             free(newNode); //Free unused Memory
             return NULL;; //Memory allocation failed
         }
-        memcpy(newNode->data, data, dataSize); //Copy Data
+        newNode->data = data; //Copy Data
 
         newNode->left = NULL;
         newNode->right = NULL;
@@ -74,16 +74,7 @@ void *nextTreeData(TreeNode *root)
 // Releases all memory resources (including data copies).
 void clearTree(TreeNode *root)
 {
-    if(root == NULL){
-        return;
-    }
-    
-    clearTree(root->right);
-    clearTree(root->left);
-    
-    free(root->data);
-    free(root);
-    
+
 }
 
 // Returns the number of entries in the tree given by root.

bintreeTest.c

@@ -1,19 +0,0 @@
-#include <stdio.h>
-#include <stdlib.h>
-#include "unity.h"
-#include "bintree.h"
-
-
-void setUp(void){
-    //Use if needed    
-}
-void tearDown(void){
-    //Use if needed
-}
-
-int main(){
-    UNITY_BEGIN();
-
-    printf("\n============================\nBintree tests\n============================\n");
-    
-}