ScholarLens Back to search
2003•International Journal of Foundations of Computer ScienceRequires access

M-Heap: A Modified Heap Data Structure

Shyam S. Bansal, S. Sreekanth, Puneet Gupta

Open publisher page 6 citations

Abstract

In this paper a new data structure named M-heaps is proposed. This data structure is a modification of the well known binary heap data structure. The new structure supports insertion in constant time and deletion in O(log n) time. Finally a generalization of the data structure to d – ary M-heaps is presented. This structure has similar time-bounds for insertion and deletion.

About this research paper

What this paper is about

In this paper a new data structure named M-heaps is proposed. This data structure is a modification of the well known binary heap data structure. The new structure supports insertion in constant time and deletion in O(log n) time. Finally a generalization of the data structure to d – ary M-heaps is presented. This structure has similar time-bounds for insertion and deletion.

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper a new data structure named M-heaps is proposed. This data structure is a modification of the well known binary heap data structure. The new structure supports insertion in constant time and deletion in O(log n) time. Finally a generalization of the data structure to d – ary M-heaps is presented. This structure has similar time-bounds for insertion and deletion.

Key concepts: Heap (data structure), Data structure, Computer science, Mathematics, Theoretical computer science, Algorithm, Combinatorics, Programming language

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
M-Heap: A Modified Heap Data Structure — Research Paper | ScholarLens