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
Main Authors Nath, Suman Kumar, Chowdhury, Rezaul Alam, Kaykobad, M
Format Journal Article
LanguageEnglish
Published 30.07.2000
Subjects
Computer Science - Data Structures and Algorithms
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.
DOI:10.48550/arxiv.cs/0007043