As an alternative to the Fibonacci heap, we design a new data structure called a 2-3 heap, which supports m decrease-key and insert operations, and n delete-min operations in O(m + n log n) time. The merit of the 2—3 heap is that it is conceptually simpler and easier to implement. The new data structure will have a wide application in graph algorithms.