资 源 简 介
An AVL tree is a self-balancing binary search tree, which is able to guarantee log(n)-time adding, finding and removing of elements. (AVL stands for the names of the tree"s inventors G.M. Adelson-Velskii and E.M. Landis.)
This class is not meant to be used in applications but intends to explain the features of such a tree to e.g. students. Even though many examples of AVL trees exist in the Internet few of them succeed in highlighting its functionality and I hope that reading my clearly structured code makes the understanding easier.
In addition to that, example operations can be run where the class prints all relevant information to the console. Additionally a graphical illustration of the tree can be printed (to the console).
