Scapegoat Tree: Loosely Balanced BST
Scapegoat trees, introduced by Galperin and Rivest in 1993, take a fundamentally different approach to self-balancing BSTs. Instead of maintaining strict invariants after every operation like AVL or…
Read more →Balanced
Red-Black Tree: Balanced BST with Color Properties
Binary search trees promise O(log n) search, insertion, and deletion. They deliver that promise only when balanced. Insert sorted data into a naive BST and you get a linked list with O(n) operations….
Read more →Fibonacci Tree: Theoretical Balanced Structure
Fibonacci trees occupy a peculiar niche in computer science: they’re simultaneously fundamental to understanding balanced trees and completely impractical for real-world use. Unlike AVL trees or…
Read more →B-Tree: Balanced Search Tree for Storage
Every time you query a database, search a file system directory, or look up a key in a production key-value store, you’re almost certainly traversing a B-Tree. This data structure, invented by Rudolf…
Read more →