This AVL tree is a general purpose AVL tree. It stores the data as void * in the tree, as such the user needs to correctly allocate memory for the data to be stored. Data types that already have ...

Implementation of an AVL tree using pointers, including rebalancing delete, and memory management. Binary trees have O(log n) performance. Usage: objects are void* pointers and can be any type of ...