Re: Using Red-Black Trees

[Björn <ssh9614@hotmail.com>]

> Are you sure you need a tree? Skip lists serve the same function, are just as
> fast as balanced trees for searching, and faster than the typical tree
> implementations for insert and delete.

I am not as familiar with skip lists as with trees. Although I would
expect both of them to work as they seem to have similar properties
and performance. When the rest of my implementation is finished I hope
to make a little comparison of which one that performs best for my
application. I will definitly have a look at PragmARC. Thanks!

/Björn