# Huffman tree generation if the frequency is same for all words

Can a valid Huffman tree be generated if the frequency of words is same for all of them?

Example :

Value     | Frequency
--------------------
Yahoo     | 2
Microsoft | 2
Amazon    | 2


## migrated from stats.stackexchange.comMay 10 '15 at 13:32

This question came from our site for people interested in statistics, machine learning, data analysis, data mining, and data visualization.