willemt/array-avl-tree

An AVL tree implemented with an array, because cache misses keep you awake at night. Using a BSD license

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.