I see this link for determining depth (height) of Huffman tree, but not useful for me.
My Question is: Knowing the frequencies of each symbol, is it possible to determine the maximum height or exactly determine the height of the tree without applying the Huffman algorithm? Is there a formula that gives this tree height?
for Example: 10-Input Symbol with Frequency 1 to 10 is 5. the above question mentioned depth is 5.
We know in my specific example the frequency is: $1$ to $10$ which means probability is: $(1/55)+(2/55)+(3/55)+(4/55)+(5/55)+(6/55)+(7/55)+(8/55)+(9/55)+(10/55) = 1 $