#include "find.h"

int main()
{
  FILE* fp = fopen("american-english","r");
  //FILE* fp = fopen("dico_test","r");
  
  if(fp == NULL) return 1 ; //File is not readable
  
  struct node* tab[26];
  for(int i=0;i<26;i++)
    {
      tab[i]=NULL;
    }
  
  //supprimer la case avant de load
  load_tree(fp,tab);//chargement de l'arbre
  
  printf("Loading done!\n");

  char mot[50];// = "aardvark";
  int taille;
  //mot = "arabesque";
  taille = 8;
  scanf("%s",mot);
  scanf("%d",&taille);
  int result;
  result = find_mot(tab,mot,taille,0);
  printf("%d\n",result);


  free_dico(tab);//libérer la mémoire
  fclose(fp);

  printf("Fin du programme\n");

  return 0;
}