84. AQA GCSE (8525) SLR13 – 3.3 Compression Huffman coding
About this video
AQA Specification Reference - Section 3.3.1 - 3.3.8
In this video we take a look at a form of compression known as Huffman coding. We look at how to interpret a Huffman tree and how you would store a piece of data using one.
Don't forget, whenever the blue note icon appears in the corner of the screen, that is your cue to take notes about the content being shown on the current slide.
00:00 Compression- Huffman coding
00:09 Intro
00:14 Huffman coding (lossless compression method)
01:05 Binary trees
01:31 Huffman encoding trees
02:09 Things to know for the exam
02:36 Example
05:51 Outro
Last updated: 07.05.25
