Category:Heap data structures

From Wikimedia Commons, the free media repository
Jump to navigation Jump to search
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.
montículo (es); Kupac (hu); Hrúga (is); куча (ru); Heap (de); Heap (lmo); هیپ (fa); 堆 (zh); Hob (da); Öbek (tr); 堆 (zh-hk); Heap (sv); ערימה (he); Cumulus (la); 堆積 (zh-hant); 堆 (zh-cn); 힙 (ko); amaso (eo); halda (cs); heap (it); tas (fr); Kuhi (et); heap (nl); Halda (sk); heap (pt); ヒープ (ja); Hip (sr); ฮีป (th); Krūva (lt); kopica (sl); Đống (vi); keko (fi); 堆 (zh-sg); Heap (id); Kopiec (pl); heap (nb); Qalaq (verilənlər strukturu) (az); купа (uk); 堆積 (zh-tw); ഹീപ് (ml); ھیپ (ckb); heap (en); الكومة (ar); 堆 (zh-hans); हीप (hi) estructura informática de datos del tipo árbol (es); structure de données en informatique (fr); struttura dati interna utilizzata in informatica (it); datastructuur op basis van bomen binnen de informatica (nl); 計算機科學中一種樹狀資料結構 (zh-hant); podatkovna struktura (sl); Datenstruktur in der Informatik (de); Estrutura de dados organizada em árvore (pt); tree-based data structure in computer science (en); datenstrukturo (eo); 計算機科學中一種樹狀資料結構 (zh); 計算機科學中一種樹狀資料結構 (zh-tw) heap, monticulo (es); tas binaire, heap (fr); Max-heap, Binär heap, Min-heap (sv); Stóg (pl); ערמה (he); hoop (nl); albero heap (it); Deap (de); Heap (vi); Heap (ml); kasa (fi); 堆積 (zh); Heap (da)
heap 
tree-based data structure in computer science
Upload media
Wikipedia-logo-v2.svg  Wikipedia
Instance ofabstract data type
Subclass oftree data structure
Authority control
Edit infobox data on Wikidata

Subcategories

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

B

F

H

T

Media in category "Heap data structures"

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