M-Heap: A Modified Heap Data Structure
S. Bansal, S. Sreekanth, P. Gupta · International Journal of Foundations of Computer Science · 2003
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.