bn:16821720n
Noun Concept
Categories: Articles with short description, Heaps (data structures)
EN
heap  heap data structure  heap property  Heap structure  Heapify
EN
In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: In a max heap, for any given node C, if P is a parent node of C, then the key 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 is called the root node. Wikipedia
English:
data structure
computer science
Definitions
Relations
Sources
EN
In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: In a max heap, for any given node C, if P is a parent node of C, then the key 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 is called the root node. Wikipedia
A data structure commonly used to implement a priority queue Wikipedia Disambiguation
Tree-based data structure in computer science Wikidata
A specialized tree-based data structure that satisfies the heap property: if B is a child node of A, then key(A) ≥ key(B). OmegaWiki
A data structure consisting of trees in which each node is greater than all its children. Wiktionary