Huffman Coding: Prefix Codes, Optimality & k-ary Merge

Huffman greedily merges the smallest weights into an optimal prefix-free tree; the same rule gives k-ary (e.g. ternary) Huffman and optimal-merge patterns whose cost is the weighted path length.