Splay Tree: Self-Adjusting BST
Splay trees are binary search trees that reorganize themselves with every operation. Unlike AVL or Red-Black trees that maintain strict balance invariants, splay trees take a different approach: they…
Read more →Selfadjusting
Pairing Heap: Self-Adjusting Heap Structure
Binary heaps are the workhorse of priority queue implementations. They’re simple, cache-friendly, and get the job done. But when you need better amortized complexity for decrease-key operations—think…
Read more →