Subj : Re: Balanced trees vs. B-trees
To   : comp.programming
From : Joe Seigh
Date : Mon Sep 12 2005 09:38 pm

Speaking of balenced trees, which ones do the least
amount of moving nodes around on inserts and deletes?
In other works, least amount of nodes (their link
pointers) getting modified.  That's probably more
important for what I have in mind than minimum
average depth.

-- 
Joe Seigh

When you get lemons, you make lemonade.
When you get hardware, you make software.

.