d-ary heap

priority queue data structure, a generalization of the binary heap in which the nodes have d children instead of 2
Thing general Q5203305
Press Enter · cited answer in seconds

d-ary heap

Summary

d-ary heap ranks in the top 2% of general entities by monthly Wikipedia readership (93 views/month).[1]

Key Facts

  • d-ary heap is a type of priority queue[2].
  • d-ary heap is a type of 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 studied by is recorded as graph theory[6].

Body

Definition and Type

Recorded subclass of include priority queue[2] and heap[3].

Why It Matters

d-ary heap ranks in the top 2% of general entities by monthly Wikipedia readership (93 views/month).[1]

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). d-ary heap. Retrieved April 10, 2026, from https://4ort.xyz/entity/d-ary-heap
MLA “d-ary heap.” 4ort.xyz Knowledge Graph, 4ort.xyz, 10 Apr. 2026, https://4ort.xyz/entity/d-ary-heap.
BibTeX @misc{4ortxyz_d-ary-heap_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{d-ary heap}}, year = {2026}, url = {https://4ort.xyz/entity/d-ary-heap}, note = {Accessed: 2026-04-10}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): d-ary heap — https://4ort.xyz/entity/d-ary-heap (retrieved 2026-04-10)

Canonical URL: https://4ort.xyz/entity/d-ary-heap · Last refreshed:

Edit History

Rolling log of changes to this entity's Wikidata record. Values shown reflect the current state of each edited property — follow the history link to see the precise diff for any edit.

  1. 17d ago · Black-hole-diver · 2026-08-04 view diff on Wikidata ↗
    Subclass of
    Subclass of priority queue, heap
    Studied by graph theory
    Said to be the same as k-ary heap
    + 1 other property edited (see Wikidata diff for full list)
    "/* wbmergeitems-from:0||Q65281682 */"
Live feed via Wikidata EventStreams. New edits appear within minutes of being made on Wikidata.