*
* The algorithm used is similar to the well-known algorithm that builds a
* Huffman tree using a minheap. In that algorithm, the leaf nodes are
*
* The algorithm used is similar to the well-known algorithm that builds a
* Huffman tree using a minheap. In that algorithm, the leaf nodes are
- /* Get the lowest and second lowest frequency nodes from
- * the remaining leaves or from the intermediate nodes.
- * */
+ /* Get the lowest and second lowest frequency nodes from the
+ * remaining leaves or from the intermediate nodes. */