void Query(Trie **trees,char* word){

    if (*word == '\0') {
        if ((*trees)->count > 0) {
            printf("存在\n");
        }else{
            printf("不存在\n");
        }
        return;
    }

    Trie **next = (*trees)->next;
    int distance = *word - 97;

    if (next[distance] != NULL) {
        return Query(&next[distance], word+1);
    }else{
        printf("单词不存在\n");
    }
}