How Huffman Trees Work - Computerphile

How do we derive the most compact codes for a situation? Huffman Trees can help. Professor Brailsford explains how computer scientists like their trees to be upside down. “Entropy in Compression - Computerphile“ precedes this: EXTRA BITS: More on Huffman Trees: Error Correction: This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: Computerphile is a sister project to Brady Haran’s Numberphile. See the full list of Brady’s video projects at: