Explore BrainMass
Share

Huffman tree

This content was STOLEN from BrainMass.com - View the original, and get the solution, here!

Hi

Please find correct answer and explain.

Question:

Consider the Huffman tree where the character frequencies are: Freq(A)=16, Freq(B)=8; Freq(C)=4;Freq(D)=2;Freq(E)=1;Freq(F)=1. The total length of the encoding with the above frequencies and the derived Huffman tree is:

Answers:

a) 62
b) 63
c) 64
d) 30
e) 31

Thanks

Annie

© BrainMass Inc. brainmass.com September 23, 2018, 12:27 am ad1c9bdddf - https://brainmass.com/computer-science/trees/huffman-tree-46942

Solution Preview

The Huffman tree will be the following
32
...

Solution Summary

Huffman tree is modeled.

$2.19