Known Performance Results of AVL trees
AVL tree is a sub optimal solution.
How to evaluate its performance?
Bounds (upper bound and lower bound) for number of comparisons:
C < 1.44 log(n+2) - 0.328
AVL trees are no more than 44% worse than optimal trees.