LinkedMinimumHeap
Represents a linked minimum heap. See MinimumHeap for general definition of minimum heap.
Linked heap is a heap with structure of a linked list. However, the order of elements in linked structure may be defined in different ways. For example, it may be a chronological order (i.e. new elements are added to the end of the order and reconstruction of the heap won't change the order). Or a list representation order (i.e. the first element is the root node, then its children go next, then their children go next, and so on and reconstruction of the heap will change the order). See implementations' documentations to get the behaviour you need.
Properties
Functions
Checks if the heap is empty.
Checks if the heap is not empty.
Retrieves the root node and removes it from the heap. It is a node with the minimum priority.
Retrieves the root node. It is a node with the minimum priority.