In a heap with n elements with the smallest element at the root, the 7th…
GATE · 2003 · CS
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)
Attempted by 737 students.
Show answer
Correct answer: D
The worked solution is available to enrolled students.
Video solution available to enrolled students.
Explore the full course: Iocl Engineers Officers Grade A Paper 2
Loading lesson…