Data Structures and Algorithms - Old Questions

10. Create a Huffman tree for the following set of data:

Given,

Now sort these characters according to their frequencies in non-decreasing order.

The tree constructed for the given characters is shown below:

Now from variable length code we get following code sequence.