哈夫曼树是又称最优二叉树，将关键词被搜索的次数看成是哈夫曼树的权值，通过构建哈夫曼树，快速归类，并且通过哈夫曼编码方式无歧义的储存各个关键词。为各个关键字设计哈夫曼编码，使得关键字能无歧义的储存。

内含说明文档-Huffman tree is also known as the optimal binary tree, the number of times the keyword is searched as a Huffman tree weights by constructing the Huffman tree, rapid classification, and by Huffman encoding unambiguous Save individual keywords. Designed for individual keywords Huffman coding, making unambiguous keywords can save. Containing documentation