Subj : Re: Balanced trees vs. B-trees
To   : comp.programming
From : Joe Seigh
Date : Wed Sep 14 2005 01:43 pm

Googmeister wrote:
> Joe Seigh wrote:
> 
>>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.
> 
> 
> Not quite sure about deletes, but it's possible
> to implement red-black trees so that they
> perform at most one single or double rotation
> per insert,  and none per search.
> 

Ok, thanks.  I'll probably check it out since my textbooks
on this just cover those and not AVL trees.  Now all I
have to do is figure out how to test all this or better
yet an end application (the api's don't sell, applications
sell issue).

-- 
Joe Seigh

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

.