fixed memory leak

src/treewalk.c

@@ -151,24 +151,25 @@ void libhqr_treewalk(libhqr_tree_t *qrtree,int k){
   int pivot = qrtree->p;
   int p = pivot;
   int a,b;
-  while(p = qrtree->nextpiv(qrtree, k, pivot, p)){
-    while(p = qrtree->prevpiv(qrtree, k, pivot, p)){
-      if(qrtree->gettype(qrtree, k, p))  libhqr_queue_tile_post(&tt,p); //segfault
-      libhqr_queue_tile_post(&ts, p);
-    }
+  if(qrtree->gettype(qrtree, k, p))  libhqr_queue_tile_post(&tt,p);
+  libhqr_queue_tile_post(&ts, p);
+
+  libhqr_queue_tile_last(&ts);
+  a = ts->numero;
+  printf("%d\n" , a);
+  libhqr_queue_tile_last(&tt);
+  b = tt->numero;
+  printf("%d\n", b);
+  while(a != b){
+    libhqr_queue_tile_get(&ts);
     libhqr_queue_tile_last(&ts);
     a = ts->numero;
-    libhqr_queue_tile_last(&tt);
-    b = tt->numero;
-    while(a != b){
-      libhqr_queue_tile_get(&ts);
-      libhqr_queue_tile_last(&ts);
-      a = ts->numero;
-    }
-    libhqr_queue_tile_get(&tt);
-    libhqr_queue_tile_last(&tt);
-    b = tt->numero;
+    printf("%d\n" , a);
   }
+  libhqr_queue_tile_get(&tt);
+  libhqr_queue_tile_last(&tt);
+  b = tt->numero;
+  printf("%d\n", b);
   libhqr_queue_tile_delete(&tt);
   libhqr_queue_tile_delete(&ts);
 }

testings/testing_treewalk.c

@@ -39,5 +39,6 @@ int main(int argc, char ** argv)
   matrix.nt = 13;
   libhqr_hqr_init( &qrtree, LIBHQR_QR, &matrix, 0, 0, 1, -1, 0, 0);
   libhqr_treewalk( &qrtree, 0);
+  libhqr_hqr_finalize( &qrtree );
   return 1;
 }