Use this class to construct new heaps
A general interface for collecting informations about elements stored in a
heap (in particular, in a
Naive implementation of rational numbers
This class implements the leftist heap, see "Functional Data Structures" by Chris Okasaki
A simple class to represent multisets
Class for non-empty heaps.
Class for iterating the elements of a heap in increasing order
Polymorphic class for representing finite trees, with unbounded branching.