application

• Huffman tree use external nodes to represent a character, It assure no prefix is repeated
• You can use minHeap to build huffman tree. in the minHeap, each element is child tree, and then pop twice, combine two child trees. then insert it back to minHeap. Until there is only one element in the Heap.