title: Best huffman tree for optimal compression
body: <p>I am coding an Huffman string compressor and I would like to have a confirmation I am doing the optimal compression with my tree.</p>
  
  <p>I am using this kind of tree:</p>
  
  <p><img src="https://i.stack.imgur.com/4aGAf.png" alt="enter image description here"></p>
  
  <p>Instead of this kinda tree:</p>
  
  <p><img src="https://i.stack.imgur.com/KHSSz.gif" alt="enter image description here"></p>
  
  <p>I think that over 10 single characters, it's not possible to compress on 8 bits..</p>
  
  <p>Is the first image really the optimal one?</p>