Subj : Re: Balanced trees vs. B-trees
To   : comp.programming
From : Ben Pfaff
Date : Sat Sep 10 2005 12:38 pm

"A. Bolmarcich" <aggedor@earl-grey.cloud9.net> writes:

> My general conclusions are that AVL trees have the best performance and
> least average node depth.  Red-Black trees have slightly lower
> performance than AVL tress and slightly greater average node depth.
> trees.  Binary B-Trees have slightly lower performance than Red-Black
> trees and even greater average node depth.  However, when parent
> pointers are not present the performance of the insert node function
> of Red-Black trees is much worse than that of AVL trees and Binary
> B-Trees.

It is difficult to compare the performance of data structures in
the absence of description of how they are being used.  In what
situation do you obtain the above results?
-- 
"Writing is easy.
 All you do is sit in front of a typewriter and open a vein."
--Walter Smith

.