[loeg]

This article only evaluates self-balancing binary trees. Binary trees have terrible cache properties and something like a B-tree (or LSM-tree for the write-heavy variant, or B-eta trees) will have much better performance than an AVL tree.