next up previous
Up: CSE 2320: Algorithms and Previous: Lemma 17.2

Lemma 17.3

Huffman exhibits optimal substructure.

Proof: Consider the optimal tree T for characters C.



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



Theorem 17.4

Huffman produces optimal prefix codes.



Copyright © 1998 The University of Texas at Arlington