資料結構›Ch9 進階樹第 43 題／共 88 題
43. Huffman Coding、Ternary Tree
#DS-09-043中Huffman CodingTernary Tree
- This question is about generalizing Huffman's algorithm to ternary codes (i.e., codes using three symbols 0, 1, and 2). Suppose that there are six characters to be encoded. For the following five ternary coding trees, select the ones that cannot possibly represent Huffman ternary codes.
📄 交大110
▤完整推導請見《WH 資工筆記 · 資料結構》Ch9 進階樹