Question

Oscar gets the bright idea of adding an arbitrary
removeElementAtIndex (int i)
to his array-based heap implementation. His implementation does the following: it re-
moves the i-th element and replaces it with the last element (the element at the lowest
level all the way to the right). To x the heap so that the heap property is preserved,
he then bubbles it down the heap, swapping it with any elements that are greater than
it. Unfortunately, this solution will not work. Provide an example heap conguration
and such a remove operation for which it would fail.

Answer 1

Think about it; what are the characteristics of a heap? Why would a bubble sort fail to return the transposed last element to its original position?

Answer 2

Got it. Thanks!

Answer 3

I'm glad to help