哈夫曼树的Java实现， 哈夫曼树又叫做最优二叉树，是一种带权值路径最短的树，这种树在信息检索等方面都很重要。-Huffman tree Java implementation, optimal binary tree Huffman tree is also called, is a weighted value of the shortest path tree, this tree is very important in information retri and so on.