Loading…
GCSE Computer Science · key term
The starting node of a tree. In a Huffman tree, its frequency is the sum of all the character frequencies.
Used by AQA
Paper 2
Revise: Huffman CodingContinue until only one node remains in the list. This final node is the root of the completed tree.
The starting node of a tree, from which every character's path begins.
Read codes from the root towards the character, following the branch labels shown. Do not assume that every tree uses the same orientation.
Check that the root frequency equals the total number of characters. Its frequency is not the number of bits in the compressed message.
Start at the root for every character, and return there immediately after reaching a leaf.
Create a free account to keep every note you open and track your progress.
