So we're learning about Huffman coding in our Data Structures course, and I was wondering what other C++ programmers think of this as far as difficulty? It seems very interesting, and I can't wait to start learning, but it's definitely unique, by building a tree from the bottom up.

It's a method of prefix-free coding commonly used for compression. IIRC, it's the basis of the bzip2 algorithm. http://en.wikipedia.org/wiki/Huffman_coding

I sure did. I would think anyone who enjoys the theoretical side of programming would like to learn about compression.

Well the guy that's teaching the Data Structures course is huge into Data Compression, and has written many articles in IEEE. So he definitely knows his stuff. If I have any difficulty, then it looks like I know the place to try and get help!

Compression is something that's always interested me, as well. Except I knew all the good algorithms have already been invented, so I lost any motivation to learn about it. Whenever I need compression in an application, I just download a .DLL and link to it.