霍夫曼高度计算和一些挑战？ [英] Huffman Height Calculation and some Challenges?

问题描述

我读了霍夫曼树的高度与 10-输入符号的频率 1到10 是 5 ！我做了很多研究，但我不能得到它很清楚，我们如何计算树的高度！任何想法？

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?

推荐答案

我通常不会看到术语height，而是depth。在任何情况下，它们意味着最长代码的位数。这实际上等于你所引用频率的五。

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.

这篇关于霍夫曼高度计算和一些挑战？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！