Trie树

#define MaxN 26
typedef struct TrieNode
{
    bool isStr; //标记是否构成单词
    struct TrieNode *next[MaxN];
}Trie;

void InsertWords(Trie *root, const char *s)
{
    if(root == NULL || *s == ‘\0‘)
        return;
    Trie *p = root;
    while(*s != ‘\0‘)
    {
        if(p->next[*s-‘a‘]==NULL)
        {
            Trie *temp = new Trie();
            for(int i = 0; i< MaxN; i++)
            {
                temp->next[i] = NULL;
            }
            temp->isStr = false;
            p->next[*s-‘a‘] = temp;
            p = p->next[*s-‘a‘];
        }
        else
        {
            p = p->next[*s-‘a‘];
        }
        s++;
    }
    p->isStr = true;
}

int SearchWord(Trie *root, const char *s)
{
    Trie *p = root;
    while(p != NULL && *s != ‘\0‘)
    {
        p = p->next[*s-‘a‘];
        s++;
    }
    return (p != NULL && p->isStr == true);
}

void delTrie(Trie *root)
{
    for(int i = 0; i < MaxN; i++)
    {
        if(root->next[i] != NULL)
            delTrie(root->next[i]);
    }
    delete root;
}