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:
“Squalor spreads its hideous length
through the carts and the asses’ feet,
squalor coils and reopens
and creeps under barrow
and heap of refuse....”
—Hilda Doolittle (1886–1961)