Red/black trees

Matthew Dillon dillon at
Sat Apr 16 18:20:02 PDT 2005

:So what advantage do the red-black trees have, since the previous data
:structure has been working fine for some time?
:Jonathon McKitrick
:My other computer is your Windows box.

    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.

					Matthew Dillon 
					<dillon at xxxxxxxxxxxxx>

More information about the Kernel mailing list