Introduction•Height-Biased Leftist Trees•Weight-Biased Leftist Trees•Acknowledgments•References
Introduction•Basics of Amortized Analysis•Meldable Priority Queues and Skew Heaps•Bibliographic Remarks•References
7Binomial, Fibonacci, and Pairing Heaps Michael L. Fredman
Introduction•Binomial Heaps•Fibonacci Heaps•Pairing Heaps•Related Developments•References
8Double-Ended Priority Queues Sartaj Sahni
Definition and an Application•Symmetric Min-Max Heaps•Interval Heaps•Min-Max Heaps•Deaps•Generic Methods for DEPQs•Meldable DEPQs•Acknowledgment•References
Get Handbook of Data Structures and Applications, 2nd Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
