Browse Source

remove wrong comment

release0.1.5
Georg Hopp 12 years ago
parent
commit
84451e7de3
  1. 1
      src/binarytree.c

1
src/binarytree.c

@ -171,7 +171,6 @@ traverse(struct element * tree, void (*cb)(int, int))
int depth = 1;
while (tree) {
/* we came from a left node */
if ((NULL == node->left || previous == node->left) &&
previous != node->right) {

Loading…
Cancel
Save