Re:Efficient AVL Tree in C#
by loeg on Sunday October 21, 2018 @01:13PM
(#18268937)
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.
[ Parent
| on HN ]
There are no comments on this comment yet.