An AVL tree is a subtype of binary search tree. Named after it’s inventors Adelson, Velskii and Landis, AVL trees have the property of dynamic self-balancing in addition to all […]