bintree_add: return the correct pointer when recursing

Signed-off-by: Timo Kokkonen <kaapeli@itanic.dy.fi>

diff --git a/bintree.c b/bintree.c
index 4b119430e513e017897aef4a851f268f7b22239d..aaad3d6fb146ee11210530ebb01e73872135225b 100644 (file)
--- a/bintree.c
+++ b/bintree.c
@@ -21,19 +21,15 @@ struct bintree *bintree_add(struct bintree *tree, struct bintree *new,
        ret = ops->compare(tree, new);
        if (ret < 0) {
                if (tree->left)
-                       bintree_add(tree->left, new, ops);
-               else
-                       tree->left = new;
-
+                       return bintree_add(tree->left, new, ops);
+               tree->left = new;
                return new;
        }
 
        if (ret > 0) {
                if (tree->right)
-                       bintree_add(tree->right, new, ops);
-               else
-                       tree->right = new;
-
+                       return bintree_add(tree->right, new, ops);
+               tree->right = new;
                return new;
        }