A SIMPLE ARRAY VERSION OF M-HEAP
2014 ◽
Vol 25
(01)
◽
pp. 67-88
Keyword(s):
Both the post-order heap and the M-heap have a full binary tree structure and have constant amortized insertion and O(logn) deletion time complexities. This paper proposes a simple array version of the M-heap, called AM-heap. The AM-heap has a complete binary tree structure and its array indexing scheme is the same as the simple indexing scheme of the conventional binary heap. An insertion on an AM-heap takes constant amortized time and a deletion takes O(logn) time where n is the number of elements in an AM-heap. The AM-heap resolves the open problem that is to design an array version of the M-heap. Also, it is simpler than the post-order heap to implement and debug.
2017 ◽
Vol 8
(4)
◽
pp. 1-10
Keyword(s):
Keyword(s):
2012 ◽
Vol 479-481
◽
pp. 1403-1408
1996 ◽
Vol 29
(11)
◽
pp. 1905-1917
◽
Keyword(s):
2010 ◽
Vol 25
(3)
◽
Keyword(s):
2010 ◽
Vol 14
(4)
◽
pp. 375-381
Keyword(s):