diff --git a/src/treewalk.c b/src/treewalk.c
index 3e934b41e150ff4f1e307e814907f9a1c287820e..acb5fab15f0b092207bc1f608689b5b6c6f295b0 100644
--- a/src/treewalk.c
+++ b/src/treewalk.c
@@ -142,18 +142,17 @@ void libhqr_queue_tile_delete (libhqr_queue_tile_t ** queue_tile)
  ***************************************************/
 
 void libhqr_treewalk(libhqr_tree_t *qrtree,int k){
-  libhqr_queue_tile_t *tt;
-  libhqr_queue_tile_t *ts;
-  tt->next = libhqr_queue_tile_new();
-  ts->next = libhqr_queue_tile_new();
-  tt->prev = libhqr_queue_tile_new();
-  ts->prev = libhqr_queue_tile_new();
-  int pivot = qrtree->p;
+  int pivot = qrtree->mt;
+  printf("%d\n" , pivot);
   int p = pivot;
+  printf("%d\n" , qrtree->nextpiv(qrtree, k, pivot, p));
   int a,b;
-  while(qrtree->nextpiv(qrtree, k, pivot, p) != -1){
-    while(qrtree->prevpiv(qrtree, k, pivot, p) != -1){
+  libhqr_queue_tile_t *tt = libhqr_queue_tile_new();
+  libhqr_queue_tile_t *ts = libhqr_queue_tile_new();
+  while(p = qrtree->nextpiv(qrtree, k, pivot, p) != -1){
+    while(qrtree->prevpiv(qrtree, k, pivot, p)){
       p = qrtree->prevpiv(qrtree, k, pivot, p);
+      printf("%d\n" , p);	  
       if(qrtree->gettype(qrtree, k, p)){
 	libhqr_queue_tile_post(&tt,p);
       }
@@ -162,16 +161,17 @@ void libhqr_treewalk(libhqr_tree_t *qrtree,int k){
     libhqr_queue_tile_last(&ts);
     libhqr_queue_tile_last(&tt);
     a = ts->numero;
+    printf("%d\n" , a);	  
     b = tt->numero;
+    printf("%d\n" , b);
     while(a != b){
       libhqr_queue_tile_get(&ts);
       libhqr_queue_tile_last(&ts);
       a = ts->numero;
-      printf("%d/n" , a);
+      printf("%d\n" , a);
     }
     libhqr_queue_tile_last(&tt);
     p = tt->numero;
-    p = qrtree->nextpiv(qrtree, k, pivot, p);
     libhqr_queue_tile_get(&tt);
   }
 }
diff --git a/testings/testing_treewalk.c b/testings/testing_treewalk.c
index f44a2793ecd96b71c6a36ba9580be4fc0dc32627..3ca3a0e06de8eea341f34745b60e997106e8a438 100644
--- a/testings/testing_treewalk.c
+++ b/testings/testing_treewalk.c
@@ -41,7 +41,7 @@ int main(int argc, char ** argv)
   libhqr_hqr_init( &qrtree, LIBHQR_QR, &matrix, 3 , 0, 2 , -1, 0, 0);
   minMN = libhqr_imin(matrix.mt, matrix.nt );
   rc = libhqr_tree_check( &matrix, &qrtree );
-  printf("%d", rc);
+  printf("%d\n", rc);
   for (k=0; k<minMN; k++) {
 
     libhqr_treewalk( &qrtree, k);