Delete Element Heap, is a Heap related problem and in this post we will see how we can solve this challenge in C++

delete the top most element from heap Deletion is there for the first element of array of heap only We replace the last node value with the first node and return the last node value and delete the last element by decreasing the count size by 1. After doing that we percolate down once from the root Heap creation for Max heap

Please check the main.cpp snippet for the solution.

This solution originally posted at: Github by @susantabiswas