title: What is the running time and space complexity of a huffman decode algorithm?
body: <p>Say we started with a text file like: </p>
  
  <pre><code>a 00 
  b 01
  c 10
  d 11
  
  00000001011011
  </code></pre>
  
  <p>The algorithm would be the typical one where you use the prefixes to build a Huffman tree, read in the encoded bits while traversing the tree until you reach a leaf, then returning the character in at that leaf. </p>
  
  <p>Could someone explain how I would determine the running time and space complexity?</p>