#include "find.h"


int find_mot(struct node **tab_ptr_tree,char mot[],int size,int fl)
{
    if(size==1 && tab_ptr_tree[fl]!=NULL)
    {
        if(tab_ptr_tree[fl]->fin==0)return 1;
        else return 0;//vrais
    }
    if(size==1 && tab_ptr_tree[fl]==NULL)return 1;//faux

    struct node *ptr_node = tab_ptr_tree[fl];
    for(int i=1;i<size;i++)
    {
        if(ptr_node->nbr_fils==0)return 1;
        for(int k=0;k<(ptr_node->nbr_fils);k++)
        {
            //if(ptr_node->fils[k]->nbr_fils==0)return 1;
            if(ptr_node->fils[k]->val==mot[i])
            {
                ptr_node=ptr_node->fils[k];
                break;
            }
	    else if(k+1==ptr_node->nbr_fils)return 1;
        }
    }

    if(ptr_node->fin==0)return 1;
    else return 0;
}

int find()
{
    return 0;
}