Example Usage
http://github.com/willemt/YABTorrent/blob/master/src/bt_blacklist.c
Tradeoffs
In comparison to red-black trees, AVL trees have slower insertion and removal but faster retrieval.
willemt / array-avl-tree
Licence: other
An AVL tree implemented with an array, because cache misses keep you awake at night. Using a BSD license
Stars: ✭ 17
Note that the project description data, including the texts, logos, images, and/or trademarks,
for each open source project belongs to its rightful owner.
If you wish to add or remove any projects, please contact us at [email protected].