Category:Heap data structures

From Wikimedia Commons, the free media repository
Jump to navigation Jump to search
 The article Heap data structures on Wikipedia projects: (en) Heap (data structure) ·
(cs) Halda (datová struktura) · (de) Heap (Datenstruktur) · (es) Montículo (programación) · (fi) Keko (tietorakenne) · (fr) Tas (informatique) · (he) ערימה (מבנה נתונים) · (is) Hrúga (tölvunarfræði) · (it) Heap · (ja) ヒープ · (ko) 힙 (자료 구조) · (lt) Krūva · (nl) Heap · (no) Heap · (pl) Kopiec (informatyka) · (pt) Heap · (ru) Сортирующее дерево · (sk) Halda · (sl) Kopica · (sv) Heap (datastruktur) · (th) ฮีป · (uk) Купа (структура даних) · (zh) 堆 (数据结构) · +/−
English: A heap in computer science, is a specialized tree-based data structure that satisfies the heap property: if B is a child node of A, then key(A) ≥ key(B). This implies that an element with the greatest key is always in the root node, and so such a heap is sometimes called a max heap.
tree-based data structure in computer science
Wikipedia-logo-v2.svg Wikipedia
Instance ofabstract data type
Subclass oftree data structure
Authority control
Blue pencil.svg


This category has the following 5 subcategories, out of 5 total.





Media in category "Heap data structures"

The following 25 files are in this category, out of 25 total.