Min-Max Fine Heaps

TL;DR

This paper introduces the min-max fine heap, a new data structure for double-ended priority queues that combines fine heap and min-max heap techniques, offering improved performance for standard operations.

Contribution

The paper presents the min-max fine heap, a novel data structure that integrates fine heap and min-max heap methods to enhance double-ended priority queue operations.

Findings

Outperforms traditional min-max heap in standard operations

Efficiently supports double-ended priority queue operations

Combines advantages of fine heap and min-max heap

Abstract

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.