From LiteratePrograms
Jump to: navigation, search

A heap is an abstract tree data structure in which each node contains a larger (for max-heaps) or smaller (for min-heaps) value than its childrens' values. They are often used to efficiently implement priority queues, graph algorithms, and sorting/selection algorithms. Although heaps are abstract, the subcategories contain implementations for specific heap data structures.


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

Pages in category "Heap"

This category contains only the following page.