In a binary max heap containing n numbers, the smallest element can be found…
GATE · 2006 · CS
In a binary max heap containing n numbers, the smallest element can be found in time
- A.
O(n)
- B.
O(Logn)
- C.
O(LogLogn)
- D.
O(1)
Attempted by 1287 students.
Show answer
Correct answer: A
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…