2–3 heap

In computer science, a 2–3 heap is a data structure, a variation on the heap, designed by Tadao Takaoka in 1999. The structure is similar to the Fibonacci heap, and borrows from the 2–3 tree.

Time costs for some common heap operations are:

Delete-min takes $O(log(n))$ amortized time.
Decrease-key takes constant amortized time.
Insertion takes constant amortized time.

References

Tadao Takaoka. Theory of 2–3 Heaps, Cocoon (1999).

This article is issued from Wikipedia - version of the Thursday, April 18, 2013. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.