Skip to main content


AVL is a library indexing objects in B-Trees.

avl_insert(), avl_remove() and avl_search() are adaptations of the AVL algorithm found in libavl v2.0.3, so that they do not use any memory allocations and their memory footprint is optimized (by eliminating non-necessary data members).

In addition to the above, this version of AVL, provides versions using locks and traversal functions.

Reach out

If you need help after reading this doc, search our community forum for an answer. There's a good chance someone else has already found a solution to the same issue.



Last updated on