What is the maximum index of kth smallest element of max heap when stored in the form of an array?

Asked Oct 07 '16 at 14:37

Active Oct 07 '16 at 14:43

Viewed 30 times

I am new to the data structures.

I am not getting from where to start. Actually, i am not getting how to solve this?

What is the maximum index of kth smallest element of max heap having N numbers when stored in the form of an array ?

Any idea or aproach how to solve this will be helpful.

edited Oct 07 '16 at 14:43

asked Oct 07 '16 at 14:37

Garrick

The kth smallest is the (N-kth) largest. You might find it easier to solve the problem by figuring out the formula for the maximum index of the kth largest. – Jim Mischel Oct 07 '16 at 21:44
Sry, I didn't get it. Can you please elaborate ? – Garrick Oct 08 '16 at 01:39

0 Answers0