前缀树

#include <stdio.h>
#include <stdbool.h>

typedef struct {
    bool end;
    struct TrieNone *next[26];
} TrieNode;


TrieNode* TrieNew()
{
    TrieNode *node = (TrieNode *)malloc(sizeof(TrieNode));
    memset(node, 0, sizeof(TrieNode));
}

void TrieInsert(TrieNode* root, char *word) {
    int len = strlen(word);

    for (int i = 0; i < len; i++) {
        char ch = word[i] - 'a';
        if ((root->next)[ch] == NULL) {
            TrieNode *node = Trie_New();
            (root->next)[ch] = node;
        }
        root = (root->next)[ch];
    }
    root->end = true;
}

void TrieDelete(TrieNode *root, char *word)
{
    
}




int main() {
    TrieNode *root = Trie_New();

}