The abstract for a paper on calculation of Huffman codes. The paper isn’t here, but the source code is. Alistair says that if you sort your array of counts, you can create the Canonical Huffman tree in memory.

http://www.cs.mu.oz.au/~alistair/abstracts/mk95%3Awads.html