Description
Create a Huffman Tree and generate the codes for each character of the following input:
mississippi river
For consistency:
1. If same priority and single character – put in priority queue alphabetically
2.Add subtrees to end of group with same priority
3.Lower number has higher priority (goes to front)
