Data Structures and Algorithms
with Object-Oriented Design Patterns in C++ 
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.
Copyright © 1997 by Bruno R. Preiss, P.Eng. All rights reserved.