# d-ary heap

> priority queue data structure, a generalization of the binary heap in which the nodes have d children instead of 2

**Wikidata**: [Q5203305](https://www.wikidata.org/wiki/Q5203305)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/D-ary_heap)  
**Source**: https://4ort.xyz/entity/d-ary-heap


## References

1. BabelNet