A Pointer-Free Data Structure for Merging Heaps and Min-Max Heaps

In this paper a data structure for the representation of mergeable heaps and rain-max heaps without using pointers is introduced. The supported operations are: Insert, Deletemax, Deletemin, Findmax, Findmin, Merge, Newheap, Deleteheap. The structure is analysed in terms of amortized time complexity, resulting in a O(1) amortized time for each operation but… CONTINUE READING