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.
<nowiki>montículo; 堆積樹; Kupac; Hrúga; куча; Heap; Heap; هیپ; 堆; Hob; Öbek; 堆; Heap; ערימה; Cumulus; 堆積; 堆; 힙; amaso; halda; heap; tas; Kuhi; heap; Heap; Halda; heap; ヒープ; Hip; Đống; Krūva; kopica; keko; купа; 堆; Овоолго(heap); Kopiec; heap; Qalaq (verilənlər strukturu); 堆積; ഹീപ്; ฮีป; ھیپ; heap; الكومة; 堆; हीप; estructura informática de datos del tipo árbol; structure de données en informatique; susunan data dalam sains komputer; struttura dati interna utilizzata in informatica; datastructuur op basis van bomen binnen de informatica; 計算機科學中一種樹狀資料結構; podatkovna struktura; Datenstruktur in der Informatik; Estrutura de dados organizada em árvore; tree-based data structure in computer science; datenstrukturo; 計算機科學中一種樹狀資料結構; 計算機科學中一種樹狀資料結構; 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</nowiki>
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

Subcategories

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

B

F

H

T

Media in category "Heap data structures"

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