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