Category:Heaps
From Wikimedia Commons, the free media repository
cs:Halda (datová struktura) | de:Heap (Datenstruktur) | en:Heap (data structure) | 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:堆 (数据结构)
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.
Media in category "Heaps"
The following 19 files are in this category, out of 19 total.