3.4 Huffman Coding - Greedy Method

2,394,418 views

About this video

Hand-picked by a BrighterTube curator · found via ErikCH/DevYouTubeList · 88% confidence

Builds a Huffman tree from character frequencies and computes code lengths and total bits, showing why the greedy choice is optimal; worked step by step on the whiteboard.

Huffman coding as a greedy algorithm: building the tree and computing code lengths.

Video by Abdul Bari, played through YouTube's embedded player.

Part of Algorithms