Tag: rudolf-bayer

Red-black trees emerged from a lineage that began with Rudolf Bayer’s symmetric binary B-trees and was recast by Leonidas Guibas and Robert Sedgewick as a two-color framework for balanced binary search trees.

Rudolf Bayer and Edward McCreight designed the B-tree to keep large ordered indexes balanced on page-oriented storage, making logarithmic search and dynamic updates practical on disks.