sucessfull testing

bintree.c

@@ -88,7 +88,7 @@ TreeNode *addToTreeRec(TreeNode *currentNode, TreeNode *newNode, CompareFctType
         }
     }
 
-    
+
     return currentNode;
 }
  
@@ -114,7 +114,6 @@ void *nextTreeData(TreeNode *root)
         // return current top entry and then pop that top entry
         stackRoot       = pop(stackRoot);
         pointerToReturn = top(stackRoot);
-      
     }