graph theory - Lower and upper bounds for height of a code trie -
for text n different characters, upper , lower bounds on height of trie formed using huffman coding?
i know n characters leaves of trie, don't know how can find relation between number of leaves , height of trie. ideas?
Comments
Post a Comment