早教吧作业答案频道 -->数学-->
给定权值(7,18,3,32,5,26,12,8),构造相应的哈夫曼树如题,麻烦写出过程,谢谢!原题我看过,不过不够细,可否细一些
题目详情
给定权值(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
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...的网友还看了以下:
有ABCDEF六个数据项,频度为6、5、4、3、2、1,构造哈夫曼树,确定哈夫曼编码.212191 2020-05-23 …
下列关于哈夫曼树的叙述错误的是A.一棵哈夫曼树是带权路径长度最短的二叉树B.一棵哈夫曼树中叶节 2020-05-24 …
下列关于哈夫曼树的叙述错误的是A.一棵哈夫曼树是带权路径长度最短的二叉树B.一棵哈夫曼树中叶结 2020-05-24 …
下面关于哈夫曼树的叙述中,正确的是(58)。A.哈夫曼树一定是完全二叉树B.哈夫曼树一定是平衡二叉树 2020-05-26 …
● 下面关于哈夫曼树的叙述中,正确的是 (58) 。 (58)A. 哈夫曼树一定是完全二叉树 B. 2020-05-26 …
关于哈夫曼树的一题,感激不尽!字符集和S={A,B,C,D,E,F},权值集合W={2,3,5,7 2020-06-18 …
以下说法错误的是().一般在哈夫曼树中,权值越大的叶子离根结点越近b哈夫曼树中没有度数为1的分支结 2020-06-23 …
若度为m的哈夫曼树中,其叶结点个数为n,则非叶结点的个数为()哈夫曼树不是最优二叉树,那每个结点度 2020-06-23 …
1、二叉树的应用-哈夫曼树(电文的编码和译码)哈夫曼编码/译码器问题描述:设计一个哈夫曼编码/译码系 2020-11-23 …
同样的权所构造出的不同的哈夫曼树的代权路径是唯一的么?求1531426916同样的权所构造出的不同的 2020-12-27 …