d-ary heap
priority queue data structure, a generalization of the binary heap in which the nodes have d children instead of 2
Press Enter · cited answer in seconds
0 sources
d-ary heap
Summary
d-ary heap ranks in the top 2% of general entities by monthly Wikipedia readership (35 views/month).[1]
Key Facts
- d-ary heap's subclass of is recorded as priority queue[2].
- d-ary heap's subclass of is recorded as heap[3].
- d-ary heap's Commons category is recorded as Algorithms[4].
- d-ary heap's said to be the same as is recorded as k-ary heap[5].
- d-ary heap's Freebase ID is recorded as /m/02rzr5r[6].
- d-ary heap's studied by is recorded as graph theory[7].
- d-ary heap's BabelNet ID is recorded as 00334916n[8].
- d-ary heap's Microsoft Academic ID is recorded as 167394581[9].
Why It Matters
d-ary heap ranks in the top 2% of general entities by monthly Wikipedia readership (35 views/month).[1]