又称单词查找树，Trie树，是一种树形结构，是一种哈希树的变种。典型应用是用于统计，排序和保存大量的字符串（但不仅限于字符串），所以经常被搜索引擎系统用于文本词频统计-Also known as word search tree, the trie is a tree structure, which is a variant of the hash tree. Typical applications are used for statistical, sort and save a lot

海量数据处理的问题是很多面试笔试中经常出现的问题，是对数据结构和算法方面的考察，在数据库和搜索引擎方面有很大的作用。-The massive data processing is a recurrent problem in many interview written test, and inspection of the data structures and algorithms, databases and search engines have a significant role.

利用双数组和字典实现了一个中文分词程序，优点是效率高，分词速度快，鲁棒性好。适合搜索引擎分词使用-Pairs of array and dictionary is a Chinese word segmentation procedure, the advantages of high efficiency, segmentation speed, robustness. Word for search engines