Computer Science, asked by kishormali4376, 1 year ago

Heap data structure can be used to implement below collection

Answers

Answered by anjali4864
2

This implementation is used in the heapsort algorithm, where it allows the space in the input array to be reused to store the heap (i.e. the algorithm is done in-place). The implementation is also useful for use as a Priority queue where use of a dynamic array allows insertion of an unbounded number of items.

Similar questions