Heap

Rarity: Rare

A topic known well beyond its field, found in many languages.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class

Work

Domain

Arts and letters

Knowledge cost

4

In collections

Nobody has pulled it yet.

What Wikipedia says

In computer science, a heap is a tree-based data structure that satisfies the heap property: In a max heap, for any given node C, if P is the parent node of C, then the key (the value) of P is greater than or equal to the key of C. In a min heap, the key of P is less than or equal to the key of C. The node at the "top" of the heap (with no parents) is called the root node.

Excerpt from the Wikipedia article “Heap (data structure)”, under the CC BY-SA 4.0 license. Read the article on Wikipedia