title: Balanced Binary Trees Depth
body: <p>When given a number of nodes we are able to calculate the min depth of the binary tree by doing log2(n) </p>
  
  <p>Where n is the number of nodes.</p>
  
  <p>If you draw the tree out for the maximum depth for example 12 nodes you work out that the maximum depth can only be 4 if the tree is to remained balanced.</p>
  
  <pre><code>                0
                 /   \
                0     0
              /  \   / \
             0    0 0   0
            /\     \     \ 
          0   0      0    0
  </code></pre>
  
  <p>Sorry for the bad ascii art. Does anyone know of a forumla that is able to calculate the max depth of a binary tree when given the number of nodes? Or at least point me in the right direction?</p>