You will find all you need here:
http://en.wikipedia.org/wiki/Huffman_coding[
^].
See also the referenced to examples in this article.
Now, the question is not quite correct: the algorithm is abstracted from the content you want to compress. But it makes some sense, because a linked list is something which resides in memory, so you will need to develop
serialization for your data. Please see:
http://en.wikipedia.org/wiki/Serialization#C_and_C.2B.2B[
^],
http://www.boost.org/doc/libs/1_46_1/libs/serialization/doc/index.html[
^] (yes, I would recommend boost serialization).
Basically, this is all you need.
Good luck,
—SA