| 1 | # AVL |
| 2 | |
| 3 | AVL is a library indexing objects in B-Trees. |
| 4 | |
| 5 | `avl_insert()`, `avl_remove()` and `avl_search()` are adaptations |
| 6 | of the AVL algorithm found in `libavl` v2.0.3, so that they do not |
| 7 | use any memory allocations and their memory footprint is optimized |
| 8 | (by eliminating non-necessary data members). |
| 9 | |
| 10 | In addition to the above, this version of AVL, provides versions using locks |
| 11 | and traversal functions. |
| 12 |