An AVL tree, named after its inventors Adelson-Velsky and Landis, is a self-balancing binary search tree. It maintains a balance factor for each node, which is the difference in heights between its ...

This is a class for an avl tree designed to function as a search tree for articles, as well as code to test the avl class. In the avl tree, each node in the tree contains a keyword and a pointer to a ...