[Olsr-dev] [PATCH] fix hash handling for IP{v4,v6}

[Hagen Paul Pfeifer]

On Tue, 6 May 2008 09:38:30 +0200, Henning Rogge <(spam-protected)> wrote:

> AVL trees are faster in terms of lookup than rbtrees, because they are
> less deep (~ 1.44*lg(n) compared to 2*lg(n)).

Right, I know the basics about trees. I concern about the fact that we are
often delete
elements and re-balancing is necessary. AVL trees requires O(lg(n)) and
RBTrees requires
at most two rotations. That is a consideration and optimization for the
_common case_.
But nice to hear that someone had check that!

HGN