Tag
melding
- Sep 22, 2026 Leftist and Skew Heaps: Merging in Logarithmic Time How a rank stored per node bounds the right spine, why skew heaps drop the rank and still amortise to logarithmic merge, and what the recursion costs. data structures
- Mar 31, 2023 Binomial Queues and the Carry Chain of Merges Why storing trees of size 2^k makes merge look like binary addition, how extract-min decomposes the forest, and what the lazy structure costs in pointers. data structures
- Nov 18, 2022 Pairing Heaps and the Two-Pass Merge How a self-adjusting heap replaces rank bookkeeping with a left-to-right then right-to-left merge, why melding is constant time, and what the amortised bounds actually are. data structures