Q. 4 In a 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: (D)
Explanation:
Q. 4 In a 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: (D)
Explanation:
