title: How to find minimum height of a binary tree, if you know its numbers of nodes?
body: <p>Let n be the number of nodes of a binary tree, then what will be the general functional term to find out the minimum height of the binary tree?</p>
  
  <p>I think it will be  n=floor(log2(n))+1. But, I think, I'm wrong. </p>