Use this class to construct new heaps
A general interface for collecting informations about elements stored in a
heap (in particular, in a LeftistHeap
).
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 non-empty heaps. We also keep a reference to the empty heap to avoid creating new objects (ugly ... there should really be explicit Node-classes for nodes with no or only one child)
Class for iterating the elements of a heap in increasing order
Polymorphic class for representing finite trees, with unbounded branching.
A general interface for collecting informations about elements stored in a heap (in particular, in a
LeftistHeap
). This class can be seen as a monomoid morphism, mapping a heap (seen as a multiset or monoid) to something else.