In a binary max heap containing n numbers, the smallest element can be found…
PYQ GATE 2006
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 1762 students.
Sign up free to check your answer
Sign up freeLoading lesson…

