title: Proof that the height of a balanced binary-search tree is log(n)
body: <p>The binary-search algorithm takes log(n) time, because of the fact that the height of the tree (with n nodes) would be log(n).</p>
  
  <p>How would you prove this?</p>