Computer Science, asked by mannanp9709, 1 year ago

What is stack using sequential organizations?

Answers

Answered by choudhary21
1
hey☺☺☺☺Time complexity is always calculated for a process. If by destructor, we mean the complete emptying of stack, and by sequential and linked organization, we mean that the data structure used to make the stack is linked list, then the time complexity is Theta(n). Its Theta(1) if destruction refers to single pop operation.
Similar questions