An AVL tree on the other is always balanced so in the worst case it will take $$O(h)$$ time to search for something, whereas h is the height of the tree and given that AVL trees are always balanced the height of the tree is at most $$logN$$ (whereas N is the number of living nodes in the network).