trie tree, 是一个高效处理字符串的比较常见的算法,能够让我们在复杂度 O(log(n))的情况下插入和查询一个字符串

一般trie（特里）树的实现例子，这里的trie树反映了一定的设计思路，但实际工程中须优化，如使用双数组的trie树。-General trie (Terry) the realization of the tree example, where the trie tree certainly reflect a degree of design ideas, but the actual project to be optimized, such as the use of dual-arra

c语言写的，用TrieTree数据结构写的英语词典，简单界面-c language written TrieTree data structure used to write the English dictionary, a simple interface

索引树的实现，用于计算含有某个前缀的单词数量。-The realization of the index tree used to calculate the number of words containing a certain prefix.