Category:Heap data structures
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.
This category has the following 4 subcategories, out of 4 total.
Media in category "Heap data structures"
The following 13 files are in this category, out of 13 total.