fixed bug in nextTreeData()

bintree.c

@@ -87,12 +87,8 @@ TreeNode *addToTreeRec(TreeNode *currentNode, TreeNode *newNode, CompareFctType
             *isDuplicate = 1;
         }
     }
-    /*
-    if (isDuplicate != NULL)
-    {
-        *isDuplicate = 0;
-    }
-    */
+
+    
     return currentNode;
 }
  
@@ -111,13 +107,14 @@ void *nextTreeData(TreeNode *root)
     {
         // Add tree to stack so that bigest entry is ontop
         stackRoot       = nextTreeDataRec(root, stackRoot);
-        pointerToReturn = stackRoot;
+        pointerToReturn = top(stackRoot);
     }
     else
     {
         // return current top entry and then pop that top entry
-        pointerToReturn = top(stackRoot);
         stackRoot       = pop(stackRoot);
+        pointerToReturn = top(stackRoot);
+      
     }