huffmantree
nounUK /ˈhʌfmən triː/
US /ˈhʌfmən triː/
A Huffman tree is a special tree-shaped chart that helps a computer store information using the shortest codes for the most common pieces.
The programmer built a Huffman tree to compress the text file so it took up less space.
OTHER MEANINGS
2. A binary tree in which the path from the root to each leaf represents a variable-length code assigned to a symbol.
Each leaf of the Huffman tree holds a character and its code.
3. A data structure used in lossless data compression to assign shorter bit strings to more frequent symbols.
The image format uses a Huffman tree to shrink the file size.
4. A tree built by repeatedly merging the two lowest-frequency nodes until only one root remains.
The algorithm constructs the Huffman tree bottom-up by merging nodes.