哈夫曼树是又称最优二叉树，将关键词被搜索的次数看成是哈夫曼树的权值，通过构建哈夫曼树，快速归类，并且通过哈夫曼编码方式无歧义的储存各个关键词。为各个关键字设计哈夫曼编码，使得关键字能无歧义的储存。 内含说明文档-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 t

最优二叉树的Java脚本文档，采用的是图搜索策略。-Optimal binary tree of Java scr ipt document, using the map search strategy.