Re: Red/black trees

[Ed <df@xxxxxx>]

On Sunday 17 April 2005 03:16, Matthew Dillon wrote:
>     The previous data structure was a doubly linked list with a bunch of
>     hacks to try to make insertions go faster.  The red-black tree should
>     be just as fast, and not require any hacks.  Plus we can simplify
>     the clustering and fsyncing code, and make other optimizations.


What about ternary trees or Patricia trees ?