Red-Black Tree: Self-Balancing Binary Search Tree
A red-black tree is a self-balancing binary search tree where each node stores an extra bit representing its color – either red or black. Invented by Rudolf Bayer in 1972 (originally called "symmetric binary B‑tree"), it was given its modern name by Guibas and Sedgewick in 1978. Red-black trees guarantee O(log n) time for search, inse ...
Posted on Sun, 26 Jul 2026 17:14:03 +0000 by ckdoublenecks