Question: Huffman Tree Part 1 Build a Huffman from this data: E-0.50 G-0.30 H-0.10 M-0.05 N- 0.05 1 Part 2 Using your tree from Part 1:

Huffman Tree Part 1 Build a Huffman from this data: E-0.50 G-0.30 H-0.10 M-0.05 N- 0.05 1 Part 2 Using your tree from Part 1: 1) Show your compressed data 2) Determine the number of bits saved over using bytes for the original string
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
