1．　　Trie树作为一种索引树，这种结构对于大小变化很大的关键字特别有用。利用Trie树实现一个英语单词辅助记忆系统，完成相应的建表和查表程序。2．　　不限定Trie树的层次。每个叶子结点只含一个关键字，采用单字符逐层分割的策略，实现Trie树的插入、删除和查询的算法，查询可以有两种方法：查询一个完整的单词或者实现以某几个字母开头的单词。-1. Trie index tree as a tree, this structure changed greatly for the size of keywords is particularly useful. Trie tree realize the use of an English word auxiliary memory system to complete the appropriate procedures to build tables and look-up table. 2. Trie is not limited to the level of the tree. Each leaf node contains only one keyword, a single-character layer by layer segmentation strategy, realize Trie tree insert, delete and query algorithms, there are two methods of inquiry: inquiry or a complete word in order to realize a number of letters at the beginning of words.