Question

In heap with n elements with the smallest element at the root, the 7th smallest element can be found in time (a) (n log n) (b) (n) (c) (log n) (d) (1)

Answer 1

Answer:

(1)

Step-by-step explanation:

If we have to use the heap interface, we can do no better  than extract the minimum 6 times, and look at the 7 minimum. Each time except the last, we can spend anywhere from 1 to log n operation, so its 0 (log n )but not theta of anything. The 7th operation is theta (1)