O'Reilly logo

Handbook of Data Structures and Applications, 2nd Edition by Sartaj Sahni, Dinesh P. Mehta

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

5

Leftist Trees*

Sartaj Sahni

University of Florida

5.1Introduction

5.2Height-Biased Leftist Trees

DefinitionInsertion Into a Max HBLTDeletion of Max Element from a Max HBLTMelding Two Max HBLTsInitializationDeletion of Arbitrary Element from a Max HBLT

5.3Weight-Biased Leftist Trees

DefinitionMax WBLT Operations

Acknowledgments

References

5.1Introduction

A single-ended priority queue (or simply, a priority queue) is a collection of elements in which each element has a priority. There are two varieties of priority queues—max and min. The primary operations supported by a max (min) priority queue are (a) find the element with maximum (minimum) priority, (b) insert an element, and (c) delete the element whose priority is maximum (minimum). ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required