heap
A heap is a specialized tree-based data structure that satisfies the heap property. The heap property states that for each node in the heap, the value of that node is either greater than or equal to (in a max heap) or less than or equal to (in a min heap) the values of its children. Heaps are often used to efficiently store a collection of elements where the highest (or lowest) value needs to be accessed quickly. They can be implemented as arrays or binary trees.
Requires login.