I read a sentence that the Height of Huffman Tree
with 10-Input Symbol
with Frequence 1 to 10
is 5
!! i do lots of study but i couldn't get it very clear and how we calculate the Height of tree
!! any idea?
可以将文章内容翻译成中文,广告屏蔽插件可能会导致该功能失效(如失效,请关闭广告屏蔽插件后再试):
问题:
回答1:
I don't usually see the term "height", but rather "depth". In any case, they mean the number of bits of the longest code. That is in fact equal to five for the frequencies you quote.