Subj : Balanced trees vs. B-trees
To   : comp.programming
From : Duck Dodgers
Date : Fri Sep 09 2005 01:00 pm

I like to think that I know my way around trees, but I was flipping
through C Unleashed and noticed Ben Pfaff say this in reference to 2-3
trees, splay trees, and multiway trees: "These methods all have
disadvantages that make them less suitable than balanced trees in
general situations". I know about the locality of reference for splay
trees, but what about multiway trees? For the sake of argument, let's
compare B-trees of order 4 with red-black and AVL trees. What are the
disadvantages to the B-tree that make it less suitable than a balanced
tree?

Thanks for your time.

.