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:
“Self-expression is not enough; experiment is not enough; the recording of special moments or cases is not enough. All of the arts have broken faith or lost connection with their origin and function. They have ceased to be concerned with the legitimate and permanent material of art.”
—Jane Heap (c. 1880–1964)