For a perfectly balanced binary search tree with N keys we saw

 h = O(log(N))      
   

But what about the height of an AVL tree with N keys?