## HEAP

### Heap

In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: If A is a parent node of B then the key of node A is ordered with respect to the key of node B with the same ordering applying across the heap. Either the keys of parent nodes are always greater than or equal to those of the children and the highest key is in the root node or the keys of parent nodes are less than or equal to those of the children and the lowest key is in the root node . Heaps are crucial in several efficient graph algorithms such as Dijkstra's algorithm, and in the sorting algorithm heapsort.

The above text is a snippet from Wikipedia: Heap (data structure)

### heap

#### Noun

1. A crowd; a throng; a multitude or great number of people.
2. A pile or mass; a collection of things laid in a body, or thrown together so as to form an elevation.
a heap of earth or stones
3. A great number or large quantity of things.
4. A data structure consisting of trees in which each node is greater than all its children.

#### Verb

1. To pile in a heap.
He heaped the laundry upon the bed and began folding.
2. To form or round into a heap, as in measuring.
3. To supply in great quantity.
They heaped praise upon their newest hero.

The above text is a snippet from Wiktionary: heap