2-3 heap

From Wikipedia, the free encyclopedia

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:

  • delete-min takes O(log(n)) amortized time
  • decrease-key takes constant amortized time
  • insertion takes constant amortized time.

[edit] References

Comp Sci logo This computer science-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../2/-/3/2-3_heap.html"