d-ary heap
Sign in to saveAlso known as d-heap
priority queue data structure, a generalization of the binary heap in which the nodes have d children instead of 2
Wikidata facts
- Subclass of
- heap
Show 2 more facts
- Commons category
- Algorithms
- studied by
- graph theory
via Wikidata · CC0