D-ary heap

From Wikipedia, the free encyclopedia

 This article is orphaned as few or no other articles link to it.
Please help introduce links in articles on related topics. (August 2007)

The d-ary heap or d-heap is a generalization of the binary heap data structure whose non-leaf nodes have d children, instead of 2.

According to Jensen et al.[1], d-ary heaps were invented by Johnson in 1975[2].

[edit] References

  1. ^ Jensen; Katajainen; Vitale (2004). "An extended truth about heaps" (PDF). 
  2. ^ Johnson, D.B. (1975). "Priority queues with update and finding minimum spanning trees". Information Processing Letters 4: 53–57. doi:10.1016/0020-0190(75)90001-0. 
 This database-related article is a stub. You can help Wikipedia by expanding it.