This file implements the leftist heaps described in the chapter 3.1 of Okasaki's "Purely functional data structures".
A leftist heap is implemented as a binary tree with a special rank value stored in each node.
rank
This implementation is functional and pure. It has the same interface as a classical heap (Wikipedia).
This file implements the leftist heaps described in the chapter 3.1 of Okasaki's "Purely functional data structures".
A leftist heap is implemented as a binary tree with a special
rankvalue stored in each node.This implementation is functional and pure. It has the same interface as a classical heap (Wikipedia).