AQA GCSE Computer Science · 8525
Paper 2
Revise: Huffman CodingEach character will eventually sit at a leaf, a node with no further branches. Combined nodes have two children, making this a binary tree.
- Revise: Interpreting Huffman Trees
A node with no children. In a Huffman tree, each leaf represents a character.