The article
Heap data structures on Wikipedia projects:
English: Aheap 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 (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; az informatikában; 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; struttura dati interna utilizzata in informatica; tree-based data structure in computer science; هيكل بيانات شجري الشكل يُستخدم في علوم الحاسب; structure de données en informatique; 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 | |
|---|
| Different from | |
|---|
|
 |
