> [!tldr] Binary tree maps of chunks used in compression algorithms A Huffman Tree is Technique used in lossless data compression. It is explained super approachably in the source video. The basic ideas is to: 1. Chunk up your data into however many chunks 2. Count how many times each chunk shows up in the data 3. Sort that list from most frequent to least frequent 4. Lay out a binary tree where each chunk exists as its leaves, with the more frequent chunks showing up higher on the tree & thus taking fewer binary bits to represent. From the article source: ![[IMG_1649.jpeg]] From the video: ![[IMG_1647.jpeg]] > [!cite] Google AI Summary > A Huffman tree is ==a binary tree structure used for lossless data compression==, assigning shorter binary codes to frequently occurring characters and longer codes to rare ones. **** # More ## Source - https://youtu.be/aoag03mSuXQ?t=1120&si=EVqUsG_jiQ6VIb4Y - https://pyimagesearch.com/2025/01/20/implementing-huffman-encoding-for-lossless-compression/