Search a desired element out of heap. Build min heap and sort the array in descending order. Delete the smallest/largest
Posted: Mon May 02, 2022 12:18 pm
Search a desired element out of heap. Build min heap and sort the array in descending order. Delete the smallest/largest node in the heap and maintain the heap property.