lkml.org 
[lkml]   [1998]   [Sep]   [19]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: AVL and hash in memory management
On Fri, 18 Sep 1998, Helge Hafting wrote:

>Cases with lots of items will have balancing cost, but they will also
>benefit from the trees.

I instead agree with David about the rebalancing issue. Unfortunately I
don' t know nothing about AVL but I know pretty well the rb_trees
and such trees avoid the rebalancing problem pretty well.

Andrea[s] Arcangeli


-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.rutgers.edu
Please read the FAQ at http://www.tux.org/lkml/

\
 
 \ /
  Last update: 2005-03-22 13:44    [W:0.075 / U:0.168 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site