The heap type.

The empty heap.

Use one e to create a heap containing the single element e.

Use empty h to test whether h is empty.

Use size h to compute the number of elements in h. Runs in O(n) time and O(log N) space.

Use head h to obtain the element on the top of the heap h. Raises Not_found if the heap is empty.

Use tail h to obtain the heap produced by discarding the element at the top of h. If h is the empty heap, then the empty heap is returned.

Use pop h to obtain the head and the tail of a heap h in one operation. Returns None if the h is empty.

Use put e h to obtain a new heap that is the result of inserting the element e into the heap h.

Use merge h1 h2 to obtain a new heap that is the result of merging all the elements of h1 and h2 into a single heap.

Use of_seq s to construct a heap from a sequence of elements. Evaluates the whole sequence. Runs in O(n) time and O(1) space.

Use to_seq h to produce a sequence of the elements in h from top to bottom.