Question

I need help with solving the following problem.

Show all the steps of the adaptive Huffman tree construction for the following sequence:

c,b,c,b,b,a,a

Use the extended ASCII code below to encode the first appearance of symbols.

Write down the bit sequence of the code and calculate the compression ratio.

Letter	ASCII code
a	01100001
b	01100010
c	01100011

Answer 1

In this coding, we will have a lot of trees with different characters with their different weights, we will make the initial weights as their frequencies and keep on connecting the two trees with minimal weight after that we will make left side as 0 and right side as 1 and then make the code.

As the string compressed from 56 bits to 11 bits.
So, the compression ratio is = Bits before compression/Bits after compression
Compression ratio=56/11=5.09