I was wondering for huffman coding, how should I implement the binary representation of each character. (I want to store it in a vector <string>)
Originally, I had a string and I appended a "1" or "0" depending on which branch I took, but the problem was that I initialized my string in my recursive function so the string automatically resets itself to nothing.
on that note, I also would like to count up all the node. I'm thinking it is similar to the initial problem.