Berg v1.0.0 Berg
A Minimum Heap for Integers
Link to this section Summary
Functions
A heap alongside an element where that element would be the smallest if it were in the heap
A heap with the same elements as the list in question
A heap whose smallest element is the minimum of the element in question and the smallest element of the heap in question
A list in ascending order (w/ all the same elements as the heap)
The smallest element of the heap
The heap in question w/o the smallest element
A Heap w/ just one element
A zero heap
Predicate: is this the zero heap?
Link to this section Types
An Element (just an Integer)
A Minimum Heap
Link to this section Functions
A heap alongside an element where that element would be the smallest if it were in the heap
A heap with the same elements as the list in question
A heap whose smallest element is the minimum of the element in question and the smallest element of the heap in question
A list in ascending order (w/ all the same elements as the heap)
The smallest element of the heap
The heap in question w/o the smallest element
A Heap w/ just one element
A zero heap
Predicate: is this the zero heap?