Freaks City

Problem Description Huffman trees are widely used in encoding applications. This problem focuses only on the construction process of a Huffman tree. Given a sequence of numbers {pi} = {p0, p1, …, pn-1}, the process to construct a Huffman tree is as follows: Find the two smallest numbers in {pi}, denote them as pa and pb. Remove pa and pb from ...