d-ary heap (Q5203305)
Jump to navigation
Jump to search
priority queue data structure, a generalization of the binary heap in which the nodes have d children instead of 2
- d-heap
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | d-ary heap |
priority queue data structure, a generalization of the binary heap in which the nodes have d children instead of 2 |
|
Statements
Algorithms
0 references
Identifiers
Sitelinks
Wikipedia(5 entries)
- enwiki D-ary heap
- fawiki هرم دیتایی
- plwiki Kopiec a-arny
- srwiki D-hip
- ukwiki D-арна купа