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 amortized time
- decrease-key takes constant amortized time
- insertion takes constant amortized time.
Famous quotes containing the word heap:
“Science is built up with facts, as a house is with stones. But a collection of facts is no more a science than a heap of stones is a house.”
—Jules Henri Poincare (1854–1912)