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:
“Now he saw by the heap of shavings still fresh at his feet, that, for him and for his work, the former lapse of time had been an illusion.”
—Henry David Thoreau (1817–1862)