哈夫曼树（Huffman tree），又名最优树，指给定n个权值作为n的叶子结点，构造一棵二叉树，若带权路径长度达到最小，称这样的二叉树为最优二叉树，也称为哈夫曼树(Huffman tree)。哈夫曼树是带权路径长度最短的树，权值较大的结点离根较近。若将树中结点赋给一个有着某种含义的数值，则这个数值称为该结点的权。(Huffman tree (Huffman tree), also known as the tree, given n as n weights of the leaf node, construct a two binary tree, if the minimum weighted path length, called the two fork tree for the two optimal binary tree, also known as Huffman tree (Huffman tree). The Huffman tree is the shortest tree with the weight path, and the larger node is closer to the root. If the node in a tree is assigned to a value with a certain meaning, the value is called the right of the node.)