상황
A string is compressed using Huffman coding, which builds a frequency-based binary tree to assign shorter codes to more frequent characters.
이 도면에 담긴 내용
그 이면의 의사결정을 읽어 보세요.
01
Calculate character frequencies from input string
02
Build priority queue and iteratively combine lowest-frequency nodes
03
Assign binary codes by tree traversal
Applicable for lossless text compression when character frequency distribution is skewed; used in many file formats.