AVL Tree

AVL tree is self-balancing binary search tree. AVL trees are faster than Red-black trees because they are more strictly balanced.