Question 81
Huffman Coding uses which tree data structure to construct optimal prefix-free variable-length codes?
Huffman coding constructs a binary prefix tree by repeatedly combining the two nodes with the smallest frequencies. A min-priority queue efficiently selects those two nodes at each step. Huffman construction uses a min-priority queue to repeatedly remove the two least-frequent nodes and merge them under a new parent. The resulting binary prefix tree gives an optimal prefix code.