Activity is now locked.
Responses are not accepted at this time.
Consider a StackSet containing N elements, implemented with linked cells . Which of the following best describes the worst case run time of the peek operation?
0
O(1)
O(log N)
O(N)
O(N^2)
O(2^N)
Powered by