In a heap with n elements with the smallest element at the root, the 7th…
PYQ GATE 2003
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 935 students.
Sign up free to check your answer
Sign up freeLoading lesson…

