Page 1 of 1

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
by answerhappygod
Search A Desired Element Out Of Heap Build Min Heap And Sort The Array In Descending Order Delete The Smallest Largest 1
Search A Desired Element Out Of Heap Build Min Heap And Sort The Array In Descending Order Delete The Smallest Largest 1 (24.76 KiB) Viewed 36 times
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.