When poll is active respond at
Send pds to 22333
Consider a QUEUE implemented by linked list, and containing N elements. If we manage to implement the enque operation in O(1) time worst case, what is the "best" worst case time complexity we can get for the deque operation?
0
O(1)
O(N)
O(N^2)
O(N^3)
O(2^N)
Powered by