查看会员资料
用 户 名：che****
发送消息- Email：用户隐藏
- Icq/MSN：
- 电话号码：
- Homepage：
- 会员简介：
最新会员发布资源
huffman.rar
- 给定n个权值作为n个叶子结点，构造一棵二叉树，若带权路径长度达到最小，称这样的二叉树为最优二叉树，也称为哈夫曼树(Huffman tree)。,Given n weights as a the n leaf node, construct a binary tree, with the right path length to a minimum, said such a binary tree for the optimal binary tree, also known as Huffman