Min-Max Fine Heaps

In this paper we present a new data structure for double ended priority queue, called min-max fine heap, which combines the techniques used in fine heap and traditional min-max heap. The standard operations on this proposed structure are also presented, and their analysis indicates that the new stru...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Nath, Suman Kumar, Rezaul Alam Chowdhury, Kaykobad, M
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 31.07.2000
Subjects
Data structures
Queues
Online AccessGet full text

Cover

More Information
Summary:In this paper we present a new data structure for double ended priority queue, called min-max fine heap, which combines the techniques used in fine heap and traditional min-max heap. The standard operations on this proposed structure are also presented, and their analysis indicates that the new structure outperforms the traditional one.
Bibliography:content type line 50
SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
ISSN:2331-8422