(Solved) : Hallo Long Task Don T Know Code Need Help Please P Task Explain Appreciate Task Binary Tre Q30568879 . . . .

Hallo There!

I have a long task and I don’t know code. I need help please påthis Task with explain why we did this!

I appreciate you!

Task

Binary trees are used in many applications, including incompression algorithms.
Read more about Huffman compression:http://www.cs.duke.edu/csed/poop/huff/info/
Some examples of how much you can compress the files with thismethod:
A file containing Swedish text of 13032 bits is compressed to 7364bits.

A file containing 16912 bit java source code is compressed to10395

A 28576 bit java bytecode file is compressed to 20727 bits,

a postscript file containing 959632 compressed to 307385bits.
Read, understand andexplain with your own words the algorithm forHuffman compression. Why does the