Create bintreeTest.c file

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
         }
-        newNode->data = data; //Copy Data
+        memcpy(newNode->data, data, dataSize); //Copy Data
 
         newNode->left = NULL;
         newNode->right = NULL;
@@ -74,6 +74,15 @@ 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);
     
 }
 

bintreeTest.c

@@ -0,0 +1,19 @@
+#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");
+    
+}