AVL tree

In an AVL tree, insertion and deletion operations are slower than in a red-black tree (with the same number of leaves, a red-black tree can be taller than an AVL tree, but not more than 1.388 times). However, searching in an AVL tree is faster (the maximum difference in search speed is 39%).