Category:Heap data structures

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.
Category:Uses of Wikidata InfoboxCategory:Uses of Wikidata Infobox with no image
montículo; 堆積樹; kupac; Hrúga; Heap (estructura de dades); Heap; Heap; هیپ; 堆; Hob; Öbek; 堆; Heap; ערימה; Cumulus; 堆積; 堆; 힙; amaso; halda; heap; tas; Kuhi; heap; हीप; куча; Heap; Halda; heap; Đống; keko; купа; Krūva; kopica; 堆積; ഹീപ്; 堆; Овоолго(heap); Kopiec; heap; Qalaq (verilənlər strukturu); ฮีป; Hip; ヒープ; ھیپ; heap; كومة; 堆; куп; estructura informática de datos del tipo árbol; structure de données en informatique; Estructura de dades basada en arbres en informàtica; Datenstruktur in der Informatik; Estrutura de dados organizada em árvore; 計算機科學中一種樹狀資料結構; podatkovna struktura; susunan data dalam sains komputer; datastructuur op basis van bomen binnen de informatica; מונח במדעי המחשב; 計算機科學中一種樹狀資料結構; 計算機科學中一種樹狀資料結構; stromová datová struktura v informatice; datenstrukturo; struttura dati interna utilizzata in informatica; tree-based data structure in computer science; هيكل بيانات شجري الشكل يُستخدم في علوم الحاسب; податочна структура во информатиката; az informatikában; heap; monticulo; tas binaire; heap; Max-heap; Binär heap; Min-heap; Stóg; ערמה; hoop; Heap; albero heap; Deap; Heap; heap data structure; kasa; 堆積; Heap
heap 
tree-based data structure in computer science
Upload media
Instance of
Subclass of
Has use
  • priority queue
Different from
Authority file
Wikidata Q274089
BabelNet ID: 16821720n
Edit infobox data on Wikidata
Category:Tree structures Category:Heaps#data%20structures

Pages in category "Category:Heap data structures"

Category:Heaps Category:Tree structures Category:Uses of Wikidata Infobox Category:Uses of Wikidata Infobox with no image