哈夫曼树是一种树形结构，用哈夫曼树的方法解编程题的算法就叫做哈夫曼算法。树并不是指植物，而是一种数据结构，因为其存放方式颇有点象一棵树有树叉因而称为树。 最简哈夫曼树是由德国数学家冯。哈夫曼 发现的，此树的特点就是引出的路程最短。 概念理解：1.路径 从树中一个节点到另一个节点之间的分支构成这两个节点之间的路径。2.路径长度 路径上的分支数目称作路径长度。-Huffman tree is a tree structure, Huffman tree algorithm method to solve programming problems is called the Huffman algorithm. Tree does not mean the plant, but a data structure, because of its storage methods have quite a bit like a tree which is called Shucha tree. Minimalist Huffman tree by the German mathematician Von. Huffman discovered feature of this tree is drawn from the shortest. Understanding of the concept: a path from one node to the tree branch paths between other nodes between the two nodes. 2 the number of branches on the path length of the path is called the path length.