Data Structures and Algorithms with Object-Oriented Design Patterns in C#

Leftist Heaps

A leftist heap is a heap-ordered binary tree which has a very special shape called a leftist tree. One of the nice properties of leftist heaps is that is possible to merge two leftist heaps efficiently. As a result, leftist heaps are suited for the implementation of mergeable priority queues.

Leftist Trees
Implementation
Merging Leftist Heaps
Putting Items into a Leftist Heap
Removing Items from a Leftist Heap