AQA GCSE Computer Science · 8525
Paper 2
Revise: Interpreting Huffman TreesTo recover the text, you need the Huffman tree that matches the compressed binary stream.
Loading…
Loading…
GCSE Computer Science · key term
A binary tree whose labelled branches give the binary code for each character, allowing Huffman-compressed data to be encoded and decoded.
Used by AQA
Paper 2
Revise: Interpreting Huffman TreesTo recover the text, you need the Huffman tree that matches the compressed binary stream.
Create a free account to keep every note you open and track your progress.