diff --git a/bintree.c b/bintree.c
index 29588cd..7239d27 100644
--- a/bintree.c
+++ b/bintree.c
@@ -51,7 +51,6 @@ TreeNode *addToTree(TreeNode *root, const void *data, size_t dataSize, CompareFc
     return root;
 }
 
-
 // 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.
@@ -90,7 +89,6 @@ void *nextTreeData(TreeNode *root) {
     return node->data;
 }
 
-
 // Releases all memory resources (including data copies).
 void clearTree(TreeNode *root) {
     if (root == NULL)