时考虑到在哈夫曼中要每次挑选两个频率最小（即出现次数最小，我那个hNode里的value 是出现的次数），很自然的就想到了std::priority_queue容器，优先队列每次都会弹出队列 中权值最高的元素，这个特性无疑是实现哈夫曼算法的最佳选择。 ... -to consider the Huffman each selected to be the smallest two frequencies (that is, the minimum number, which I hN

哈夫曼编码。排序问题，利用贪心算法的思想实现哈夫曼编码算法程序 -Huffman coding. Scheduling problems, the greedy algorithm achieving Huffman coding algorithm

实现数据的压缩，演示Huffman二叉树的应用。虽然压缩效果不如rar等，但是作为一种算法，具有可借鉴的价值。-data compression, presentations Huffman binary tree applications. Although not rar compression, but as an algorithm that can draw is the value.