I have a MinHeap of Integer For Example. I would like to ask if there is way to make increase for some value from the middle of the heap and still save the heap Sorted correctly .
Thanks
Asked
Active
Viewed 44 times
0
-
I'm afraid I don't understand what you're asking. Can you give an example? – beaker May 23 '16 at 15:18
-
I try to explain again: I have a minHeap of my object and i want to edit a specific object in the heap and after the edit make a action that the heap still be "sorted" - king of heapify action – Roey Mizrahi May 23 '16 at 19:07
-
I mean to make Increase Key action in MinHeap – Roey Mizrahi May 23 '16 at 19:46
-
Okay, so you remove the item, modify it, and then insert it again. – beaker May 23 '16 at 19:52
-
but in the Heap I can remove only the Min Element. I want to increase on every element – Roey Mizrahi May 23 '16 at 19:57
-
Are you able to modify the source code of your heap class? This is something that you'd have to add as a special operation. It's not a typical operation for a binary heap. – Jim Mischel Aug 05 '16 at 13:05