Page "AVL tree" Paragraph 5
from
Wikipedia
Lookup in an AVL tree is performed exactly like in any unbalanced binary search tree.
Because of the height-balancing of the tree, a lookup takes O ( log n ) time.
No special actions need to be taken, and the tree's structure is not modified by lookups.
( This is in contrast to splay tree lookups, which do modify their tree's structure.
Page 1 of 1.
2.442 seconds.