AVLtree Algorithm

For lookup-intensive applications, AVL trees are faster than red – black trees because they are more strictly balanced. The AVL tree is named after its two Soviet inventors, Georgy Adelson-Velsky and Evgenii Landis, who published it in their 1962 paper" An algorithm for the organization of information".

AVLtree source code, pseudocode and analysis