如何从C中删除树词典中的单词？

Question

我使用树在C中实现了一个字典，这个树存储了一个单词，其定义如下：

如您所见，有些单词共享相同的字母。但现在我想实现一个删除功能，但不知道如何继续......我知道我应该开始删除这个词的结尾......这是我的代码，谢谢你将来的帮助！

#include <stdio.h>
#include <stdlib.h>
#include <string.h>


typedef struct _noeud{
    char *value;
    struct _noeud *child[26];
}noeud_t;

typedef struct tree{
    node_t root;
}Tree;

Tree dict;

int getPos(char letter){
    char alpha[26]={'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
    int i;
    for(i=0;i<strlen(alpha);i++){
        if(alpha[i]==letter){
            return i;
        }
    }
    return -1;

}

void addWord(node_t *node, char *word, char *def){
    int i;
    for(i = 0; i < strlen(word);i++){
        int letter=getPos(word[i]);
        if(letter==-1){
            printf("Unknown letter... 
");
        }
        node_t *parent = node;
        node = node->child[letter];
        if(!node){
            node = malloc(sizeof(node_t));
            parent->child[letter]=node;
        }
    }
    node->value = malloc(strlen(def)+1);
    strncpy(node->value,def,strlen(def)),
    printf("Word %s added to dictionnary.
",word);
    fflush(stdin);
}

void findWord(node_t *node, char *word){
    printf("Looking for word %s 
",word);
    int i;
    for(i=0;i<strlen(word);i++) {
        int letter = getPos(word[i]);
        if(NULL ==node->child[letter]){
            printf("Unknown word ...
");
            return;
        }
        else{
            node = node->child[letter];
        }
    }
    printf("Word found, its definition is : %s
",node->value);

}

void deleteWord(node_t *node, char *word){
    int i=0;
    for(i=0;i<strlen(word);i++) {
        //...
    }
    printf("Word deleted !
");
}


int main(){
    addWord(&dico.root,"dog","it's an animal");
    addWord(&dico.root,"pineapple","it's a fruit");
    addWord(&dico.root,"car","something to drive");
    findWord(&dico.root,"dog");
    findWord(&dico.root,"car");
    findWord(&dico.root,"pineapple");
    deleteWord(&dico.root,"pineapple");
    return 0;
}