If top of the stack will be at position 0, then time complexity for .pdf
0 likes6 views
The document discusses the time complexity of stack operations when the top of the stack is positioned at 0. It states that the time complexity for push, pop, and top operations is O(n) due to the need to rearrange elements. Each operation requires popping all elements to access or modify the top element.
1 of 1
Download to read offline
More Related Content
More from anushasarees (20)
Recently uploaded (20)
If top of the stack will be at position 0, then time complexity for .pdf
- 1. If top of the stack will be at position 0, then time complexity for operations: 1. push() : O(n) => you need to pop all elements then push at postion 0 then again insert all poped elements 2. pop() : O(n) => first go to postion 0 then push all other elemnts 3. top() : O(n) => pop all other elements to get 0th element Solution If top of the stack will be at position 0, then time complexity for operations: 1. push() : O(n) => you need to pop all elements then push at postion 0 then again insert all poped elements 2. pop() : O(n) => first go to postion 0 then push all other elemnts 3. top() : O(n) => pop all other elements to get 0th element