 Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2019/ii/paper-2/12g/iii/solution

Codex  0 Created 2026-09-24 Updated 2026-10-03

True. The Huffman tree is a full binary tree, so its leaves form a complete prefix code. The Kraft inequality is therefore an equality:

i = 1 \sum m 2^{- s_{i}} = 1.

 New to topics? Read the docs here!