diff --git a/src/treewalk.c b/src/treewalk.c
index 223d1768825f52e0fd9d013b4f6bd4b6093badf7..4fd9b131cffc2dc229f9c506ed374a54c2415ccf 100644
--- a/src/treewalk.c
+++ b/src/treewalk.c
@@ -173,6 +173,4 @@ void libhqr_treewalk(libhqr_tree_t *qrtree,int k){
     libhqr_queue_tile_last(&tt);
     p = tt->numero;
   }
-  libhqr_queue_tile_delete(&tt);
-  libhqr_queue_tile_delete(&ts);
 }
diff --git a/testings/testing_treewalk.c b/testings/testing_treewalk.c
index 15314a68093471758efc5fa62e19bc6b5d82811a..d872a318a8245e429f2d1dabd6a96d880da469d9 100644
--- a/testings/testing_treewalk.c
+++ b/testings/testing_treewalk.c
@@ -1,18 +1,18 @@
 /**
-  *
-  * @file testing_treewalk.c
-  *
-  * PaStiX symbol structure routines
-  *
-  * @copyright 2017 Bordeaux INP, CNRS (LaBRI UMR 5800), Inria,
-  *                      Univ. Bordeaux. All rights reserved.
-  *
-  * @version 1.0.0
-  * @author Raphael Boucherie
-  * @author Matthieu Faverge
-  * @date 2017-03-21
-  *
-  **/
+ *
+ * @file testing_treewalk.c
+ *
+ * PaStiX symbol structure routines
+ *
+ * @copyright 2017 Bordeaux INP, CNRS (LaBRI UMR 5800), Inria,
+ *                      Univ. Bordeaux. All rights reserved.
+ *
+ * @version 1.0.0
+ * @author Raphael Boucherie
+ * @author Matthieu Faverge
+ * @date 2017-03-21
+ *
+ **/
 
 
 #include "libhqr.h"
@@ -28,6 +28,7 @@ int main(int argc, char ** argv)
 {
   libhqr_tree_t qrtree;
   libhqr_tiledesc_t matrix;
+  int minMN, k;
   /*
    *
    * Tests for HQR code
@@ -35,10 +36,13 @@ int main(int argc, char ** argv)
    */
   matrix.nodes = 1;
   matrix.p = 1;
-  matrix.mt = 10;
+  matrix.mt = 4;
   matrix.nt = 13;
-  libhqr_hqr_init( &qrtree, LIBHQR_QR, &matrix, 0, 0, 1, -1, 0, 0);
-  libhqr_treewalk( &qrtree, 0);
+  libhqr_hqr_init( &qrtree, LIBHQR_QR, &matrix, 3 , 0, 2 , -1, 0, 1);
+  minMN = libhqr_imin(matrix.mt, matrix.nt );
+  for (k=0; k<minMN; k++) {
+
+    libhqr_treewalk( &qrtree, k);
+  }
   libhqr_hqr_finalize( &qrtree );
-  return 1;
 }