B-Trees Require Fewer Comparisons Than Balanced Binary Search Trees

Re:B-Trees Require Fewer Comparisons Than Balanced Binary Se... by e12e on Monday June 24, 2024 @05:57AM (#40774135)

I have a soft spot for red-black trees ever since reading about them in Dr. Dobbs - it's the first time I remember reading about a data structure (and it went mostly over my head at the time - but the fond memory remain):

I believe it was the 1992 article by Bruce Schneier: