A Heap Data Structure where the value of a node is the value of its parent.
Allows element to be assigned a ‘priority’.
Items are inserted greatest to lowest priority.

A Heap Data Structure where the value of a node is ≤ the value of its parent.
Allows element to be assigned a ‘priority’.
Items are inserted greatest to lowest priority.
