An AVL tree is a self-balancing binary tree structure. It can be the basis of many types of data structures. For example, a red-black tree– which is a similar data structure to an AVL tree– is the basis for many common C++ data structures, such as mappings and sets.

This library attempts to provide a basic, customizable AVL tree for the implementation of other data structures which call for a self-balancing tree, such as an interval tree.