Improved Upper Bounds for Pairing Heaps
Pairing heaps are shown to have constant amortized time insert and zero amortized time meld, thus improving the previous O(log n) amortized time bound on these operations. It is also shown that pairing heaps have a distribution sensitive behavior whereby the cost to perform an extract-min on an element x is O(log min(n, k)) where k is the number of heap operations performed since x’s insertion. Fredman has observed that pairing heaps can be used to merge sorted lists of varying sized optimally, within constant factors. Utilizing the distribution sensitive behavior of pairing heap, an alternative method the employs pairing heaps for optimal list merging is derived.
KeywordsActual Cost Potential Gain Execution Sequence White Node Black Node
Unable to display preview. Download preview PDF.
- 1.R. Cole. On the dynamic finger conjecture for splay trees. part ii: The proof. Technical Report Computer Science TR1995-701, New York Univerity, 1995.Google Scholar
- 2.R. Cole, B. Mishra, J. Schmidt, and A. Siegel. On the dynamic finger conjecture for splay trees. part i: Splay sorting log n-block sequences. Technical Report Computer Science TR1995-700, New York Univerity, 1995.Google Scholar
- 3.M. L. Fredman. Manuscript in preparation.Google Scholar
- 8.Haim Kaplan and Robert E. Tarjan. New heap data structures. Technical Report Computer Science TR-597-99, Princeton University, 1999.Google Scholar
- 12.R. Sundar. Amoritzed Complexity of Data Structures. PhD thesis, New York University, 1991.Google Scholar