
    printf(" root, [");
  }
  else if(TREE[n].left == fr){
    printf(" leef, [");
  }
  else printf(" internal node,[");

  i=TREE[n].left;
  while(i!=fr){
    printf("%d",i);

    i = TREE[i].right;

    if(i!=fr){
      printf(", ");
    }
  }
  printf("]\n");
}