Explain Huffman Coding.

Explain Huffman Coding.

Approach: Describe a greedy algorithm for lossless data compression.

An algorithm used for lossless data compression. It assigns variable-length codes to characters based on their frequencies, using a binary tree where more frequent characters have shorter codes.

Follow-up: Is it a prefix-free code?

Key concepts: binary tree, prefix code, frequency.