Page "AVL tree" Paragraph 2

AVL trees are often compared with red-black trees because they support the same set of operations and because red-black trees also take O ( log n ) time for the basic operations.

Because AVL trees are more rigidly balanced, they are faster than red-black trees for lookup intensive applications.

Similar to red-black trees, AVL trees are in general not weight-balanced, that is sibling nodes can have hugely differing numbers of descendants.