Jump to navigation Jump to search
Time costs for some common heap operations are:
- Delete-min takes amortized time.
- Decrease-key takes constant amortized time.
- Insertion takes constant amortized time.
- Tadao Takaoka. Theory of 2–3 Heaps, Cocoon (1999).
|This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.|