Open

Avl tree look up vs insertion

I was exploring about AVL trees and found this answer where the person says that the look ups in AVL is faster as compared to insertion or deletion.

Though for all those 3 processes the worst time complexity is still Logarithmic.

Is it because of the rotation or balancing involved during insertion ?