Search a desired element out of heap. Build min heap and sort the array in descending order. Delete the smallest/largest
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Search a desired element out of heap. Build min heap and sort the array in descending order. Delete the smallest/largest
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.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!