构造一棵二叉树，若带权路径长度达到最小，称这样的二叉树为最优二叉树，也称为哈夫曼树-Construct a binary tree, if the weighted path length to a minimum, so called binary tree is optimal binary tree, also known as Huffman