title: How can i generate a binary code table of a huffman tree?
body: <p>I want to implement an function which gives me a binary code for each char in a huffman tree.</p>
  
  <p>To implement the function i tried traversing the table by using a recursive function. However i don't know how to fill the result the binary code for each char so that the function returns an array of struct with all the chars and binary codes</p>
  
  <p>I hope someone can point me in the right direction.</p>
  
  <p>Thanks ahead!</p>