给定权值(7,18,3,32,5,26,12,8),构造相应的哈夫曼树

来源：学生作业帮编辑：作业帮分类：数学作业时间：2024/05/08 04:51:33

给定权值(7,18,3,32,5,26,12,8),构造相应的哈夫曼树
如题,麻烦写出过程,谢谢!
原题我看过,不过不够细,可否细一些

这还不够细?
3+5=8,此时序列为8 7 8 12 18 26 32
7+8=15,此时序列为15 8 12 18 26 32
8+12=20,此时序列为15 20 18 26 32
……每一步都挑最小的两个相加.
图见下面.
多看书,baidu上不好画图,打这些东西很累.
------------------
原答题者：plause
按权值大小排列后 3 5 7 8 12 18 26 32
只要按照将最小的两个合并, 合并后的值再入列中(最小的两个出列), 至到列中只有一个值.
按上面要求构造哈夫曼树如下:
/////树列完后, 可取左树编码为0, 右为 1, (左为 1, 右为 0 亦可)
[3]`````[5]`````````[7]``````[8]
``\`````/`````````````\``````/
`0`\```/`1```````````0`\````/`1
````\`/`````````````````\``/
````(8)`````[12]````````(15)`````[18]
``````\``````/`````````````\``````/
`````0`\````/`1```````````0`\````/`1
````````\``/`````````````````\``/
````````(20)``````[26]```````(33)``````[32]
```````````\``````/`````````````\``````/
``````````0`\````/`1```````````0`\````/`1
`````````````\``/`````````````````\``/
`````````````(46)`````````````````(65)
````````````````\`````````````````/
```````````````0`\```````````````/`1
``````````````````\`````````````/
```````````````````````(111)
则按上面的树可得到各权值所对应的编码:
//// 其编码是从树顶到该权值点所经过的 1 或 0 的序列
[`7]:``1`0`0`0
[18]:``1`0`1
[`3]:``0`0`0`0
[32]:``1`1
[`5]:``0`0`0`1
[26]:``0`1
[12]:``0`0`1
[`8]:``1`0`0`1

给定权值(7,18,3,32,5,26,12,8),构造相应的哈夫曼树给定权值(15,3,14,2,6,9,16,17),构造相应的哈夫曼树给定权值〔3,9,13,5,7〕,构造相应的哈夫曼树,并计算其大带权路径长度,求发图设给定一个权值集合W=(3,5,4,9,11,8,15),要求根据给定的权值集合构造一棵哈夫曼树 2．设给定一个权值集合W=(3,5,7,9,11),要求根据给定的权值集合构造一棵哈夫曼树并计算哈夫曼树的带权路径长度W 给定权3,4,5,6,7,8,9,试用算法构造一棵最优二叉树,画出这棵树并计算出它的权.（离散数学） 32．对给定的数列R＝{7,16,4,8,20,9,6,18,5},构造一棵二叉排序树,并且（1）给出按中序遍历得到设给定一个权值集合W=(9,4,10,6,3,10,8,15,12,16,2,11),构造一个哈夫曼树数据结构问题：给定一组数据{6,2,7,10,3,12}以它构造一棵哈夫曼树,则树高为5,带权路径96,但是给定数据序列d={7,16,4,8,20,9,6,18,5},构造一棵二叉排列数,并求出该二叉排列树查找成功的平均查找长请构造相应的逻辑推理过程. 构造哈夫曼树：以数据集（3,4,5,8,11,18,20,30）为结点,构造一棵哈夫曼数,并求其带权路径长度.