Question

Q 12: What is the time complexity of building a stack of size n?
O O(n^2)
O O(n)
O 0(1)
O(nlogn)​

Answer 1

Answer:

o(nlogn)

this is the answer of this question

I hope this will help you