Messages in this thread | | | Date | Fri, 18 Sep 1998 20:54:18 +0200 (CEST) | From | Andrea Arcangeli <> | Subject | Re: 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/
| |