for (i = 0; i < CHAR_COUNT; i++) /* 扩展 */
{
if (root->next[i])
{
word[pos++] = i;
dfs_travel(root->next[i]);
pos--; /* 返回上一层时恢复位置 */
}
}
}
int main()
{
char line[MAX_WORD_LEN + 1];
trie_tree_t *trie_tree = trie_tree_create();
int i=0;
while(1)
{
gets(line);
trie_tree_insert(trie_tree, line);
n++;
if(i++>3)
break;
}
dfs_travel(trie_tree->root);
while(1)
{
gets(line);
if(trie_tree_query(trie_tree,line))
printf("%s is in \n",line);
else
printf("%s is not in \n",line);
}
trie_tree_destroy(trie_tree);
return 0;
}