Theory of 2–3 Heaps Original Research Article

As an alternative to the Fibonacci heap, we design a new data structure called a 2–3 heap, which supports n insert, n delete-min, and m decrease-key operations in O(m+n log n) time. Our experiments show the 2–3 heap is more efficient. The new data structure will have a wide application in graph algorithms.