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:
“Mortality, behold, and fear,
What a change of flesh is here!
Think how many royal bones
Sleep within this heap of stones,
Hence removed from beds of ease,
Dainty fare, and what might please,”
—Francis Beaumont (1584-1616)