Here are the Lecture 12 slides.

We discussed how the Huffman algorithm which finds the optimal prefix-free compression code for a given frequency of characters over an alphabet. A video from last year covers the material: