When poll is active respond at
PollEv.com​/pds
Send
pds
to
22333
Consider a binary heap (min heap) with N elements in it. What is the worst case time complexity of the "getMin" operation?
165
93%
154
O(1)
2%
4
O(log N)
4%
6
O(N)
1%
1
O(N log N)
0%
0
O(N^2)
0%
0
O(2^N)
See more
Powered by