user5476593
Reputation:
Min-Max heap delete max element
I'm confused about the final image after a delete-max operation. When 87 is deleted does 48 get brought to the spot that 87 once held? Does the rest of the tree not change after?
Upvotes: 0
Views: 904
Answers (1)
Jim Mischel
Reputation: 134125
No. 78 would be bubbled up to fill the spot that 87 once held.
You should read the original paper: Min-Max Heaps and Generalized Priority Queues: http://www.cs.otago.ac.nz/staffpriv/mike/Papers/MinMaxHeaps/MinMaxHeaps.pdf
Upvotes: 1
Related Questions
- How can building a heap be O(n) time complexity?
- Image Processing: Algorithm Improvement for 'Coca-Cola Can' Recognition
- What and where are the stack and heap?
- Find running median from a stream of integers
- What do I use for a max-heap implementation in Python?
- transforming max-heap into min-heap with heapfy
- Replacing a 32-bit loop counter with 64-bit introduces crazy performance deviations with _mm_popcnt_u64 on Intel CPUs
- Max heap vs Min heap for kth smallest element
- Understand how min-max heap looks like after after delete-min and delete-max
- Delete-max operation in a min-max heap