about heap and deleting the i-th item
I want to write an algorithm that will delete the i-th item in the heap which has o(logn),also I want to know that the i-th element will be the less one item in the heap or no?
is there any site that help me to write this algorithm?
please help me thanks
about heap and deleting the i-th item
===

I want to write an algorithm that will delete the i-th item in the heap which has o(logn),also I want to know that the i-th element will be the less one item in the heap or no?
is there any site that help me to write this algorithm?
please help me thanks