Huffman Encoding
Medium Accuracy: 36.85% Submissions: 10523 Points: 4

Given An array of Alphabets and their frequency. Your task is to print all the given alphabets Huffman Encoding.
Note: If two elements have same frequency, then the element which if at first will be taken on left of Binary Tree and other one to right.

Input:
First line consists of test cases T. First line of every test case consists of string of alphabets and second line consists of its frequencies.

Output:
Print the HuffmanCodes in single line, with n spaces of each alphabet's HuffmanCodes respectively. In PreOrder form of Binary Tree.

Constraints:
1<=T<=100
1<=|String length|<=26

Example:
Input:

1
abcdef
5 9 12 13 16 45
Output:
0 100 101 1100 1101 111 

Explanation:
For the above test case.
HuffmanCodes will be
f: 0
c: 100
d: 101
a: 1100
b: 1101
e: 111
Print in the PreOrder of Binary Tree.

to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Login to access your submissions.

Output Window