bugfix: avltree_delete needs to pass UINT32_MAX as sentinel

Signed-off-by: Laurent Bercot <ska@appnovation.com>

1 files changed, 5 insertions, 7 deletions

diff --git a/src/libdatastruct/avlnode_insertnode.c b/src/libdatastruct/avlnode_insertnode.c
index 294b109..5bb22d2 100644
--- a/src/libdatastruct/avlnode_insertnode.c
+++ b/src/libdatastruct/avlnode_insertnode.c
@@ -10,7 +10,6 @@ uint32_t avlnode_insertnode (avlnode *s, uint32_t max, uint32_t r, uint32_t i, d
   uint32_t stack[AVLNODE_MAXDEPTH] ;
   uint8_t spin[AVLNODE_MAXDEPTH] ;
   uint8_t sp = 0 ;
-  
   {
     void const *k = (*dtok)(s[i].data, p) ;
     for (; r < max ; sp++)
@@ -31,13 +30,12 @@ uint32_t avlnode_insertnode (avlnode *s, uint32_t max, uint32_t r, uint32_t i, d
   return r ;
 
  lastfix:
-  if (avlnode_ufroms(s[r].balance) != spin[sp])
+  if (avlnode_ufroms(s[r].balance) != spin[sp]) s[r].balance = 0 ;
+  else
   {
-    s[r].balance = 0 ;
-    return stack[0] ;
+    r = avlnode_rotate_maydouble(s, max, r, !spin[sp], spin[sp] != spin[sp+1]) ;
+    if (!sp--) return r ;
+    s[stack[sp]].child[spin[sp]] = r ;
   }
-  r = avlnode_rotate_maydouble(s, max, r, !spin[sp], spin[sp] != spin[sp+1]) ;
-  if (!sp--) return r ;
-  s[stack[sp]].child[spin[sp]] = r ;
   return stack[0] ;
 }