假定某系统在通信联络中只可能出现8种字符a,b,c,d,e,f,g,h,各字符出现的概率分别为0.03,0.28.0.06,0.070.14,0.24,0.08,0.10（1）画出哈夫曼树（2）给出每个字符的哈夫曼编码;(3)计算其带权路径长度WPL.

Question

假定某系统在通信联络中只可能出现8种字符a,b,c,d,e,f,g,h,各字符出现的概率分别为0.03,0.28.0.06,0.07
0.14,0.24,0.08,0.10
（1）画出哈夫曼树
（2）给出每个字符的哈夫曼编码;
(3)计算其带权路径长度WPL.
有知道的,请辛苦回答下,

Answer 1

a:0110;
b:10;
c:0111;
d:1111;
e:110;
f:00;
g:1110;
h:010.
WPL=2*0.24+3*0.1+4*0.03+4*0.06+4*0.07+4*0.08+3*0.14+2*0.28=2.72
注：树传不上来,你可以根据编码自己画,谢谢!