Leftist-tree-ops
The basic heap operations of leftist trees.
The core operation here is MERGE-LT. All the other operations are
defined in terms of MERGE-LT, which makes leftist trees relatively easy to
reason about.
Subtopics
- Merge-lt
- Merge two leftist trees
- Insert-lt
- Insert an element into a leftist tree
- Find-min-lt
- Get the minimum element of a leftist tree
- Build-lt
- Build a leftist tree from a list
- Delete-min-lt
- Delete the minimum element of a leftist tree
