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 sequence of bits, each of which is 0 or 1.
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.