Quiz on greedy algorithm

#1

i am not getting the first question of this quiz given
Consider the following message: aabbbbabccdddccccbbdd
If Huffman tree is coded as left child with ‘0’ and right child with ‘1’ from every node then what is the decoded message for 110100?

what is huffman tree and huffman coding??

#2

Hi @aditikandhway Huffman Coding is a lossless data compression algorithm that follows the greedy approach. You can look for the video covering it in the course or read about it from some other resource.

#3

But there is not such videos in the course… so which resource I should choose for this?

#4

@aditikandhway you can find a lot of videos and articles, can refer to any of those.