Abstract
Fredman et al. have shown that the amortized cost for deleting the item with the minimum value from a pairing heap is O(√n), no matter how the pairing is done [M. Fredman, R. Sedgewick, D. Sleator, and R. Tarjan, The Pairing heap: a new form of self-adjusting heap, Algorithmica 1(1) (1986), pp. 111–129]. In this paper, this upper bound is shown to be realizable (indicating that their analysis is tight). More precisely, starting with any n-node heap, we consider an alternating sequence of the operations: delete-min and insert; and give a pairing strategy for which Θ(√n) is the amortized cost per delete-min, irrespective of the initial heap structure. More interesting is that, starting with any initial structure, the heap will converge after O(n 1.5) operations to the same structure, which we call the square-root tree.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
