Computer Science · Algorithms & Data Structures
A topic within Algorithms & Data Structures, itself one of 15 topics in that field and part of Computer Science.
2 works
Leo J. Guibas & Robert Sedgewick
Recasts several balanced tree schemes, including red-black trees, as instances of one framework that colours nodes to bound rebalancing cost.
link checked 17 Sept 2026Daniel D. Sleator & Robert E. Tarjan
Argues a binary search tree that moves each accessed node to the root by rotations needs no balance information at all, yet matches balanced trees' amortised cost.