Left-Leaning Red-Black Tree: Simplified LLRB
Red-black trees are the workhorses of balanced binary search trees. They power std::map in C++, TreeMap in Java, and countless database indexes. But if you’ve ever tried to implement one from…
Simplified
Facade Pattern: Simplified Interface
Every mature codebase accumulates complexity. What starts as a few classes eventually becomes a web of interconnected subsystems, each with its own initialization requirements, configuration options,…
Read more →AA Tree: Simplified Red-Black Tree
In 1993, Swedish computer scientist Arne Andersson published a paper that should have changed how we teach self-balancing binary search trees. His AA tree (named after his initials) achieves the same…
Read more →