Consider the stack size is 1000 and it's full. Compute the time complexity of pop() operation.
Select one:
O a. O(nlogn)
O b. 0(1)
Oc O(logn)
Od. O(n)
Answers
Answered by
2
Answer:
delusional and I don't know what I want to be a good day at
Similar questions