next up previous
Next: Up: Previous:

Lemma 16.3

Huffman exhibits optimal substructure.

Proof: Consider the optimal tree T for characters C.



\psfig{figure=figures/f9-6.ps}



Theorem 16.4

Huffman produces optimal prefix codes.


next up previous
Next: Up: Previous: