Let h be the maximum height for an AVL tree with N nodes. Then f(h) must be <= N.

  2h/2 < f(h) <= N

Taking log₂ we get

      h/2 < log2(N)

      or

      h < 2log2(N)


   

So the height of an AVL tree with N nodes is O(log(N)).