D-ary heap
id:
d-ary-heap-249-2028394
title:
D-ary heap
text:
The d-ary heap or d-heap is a priority queue data structure, a generalization of the binary heap in which the nodes have d children instead of 2. Thus, a binary heap is a 2-heap, and a ternary heap is a 3-heap. According to Tarjan and Jensen et al., d-ary heaps were invented by Donald B. Johnson in 1975. This data structure allows decrease priority operations to be performed more quickly than binary heaps, at the expense of slower delete minimum operations. This tradeoff leads to better running
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/D-ary_heap
date created:
date modified:
2024-04-18T05:14:47Z
main entity:
{"identifier":"Q5203305","url":"https://www.wikidata.org/entity/Q5203305"}
image:
fields total:
13
integrity:
13