Implementation of the Stack ADT using Singly Linked List and the Time Complexity Analysis of the Push and Pop Operations In thi

Answer 1

The time complexity for push and pop is constant time O(1) for a list-based stack.

If you implement one you'll find out why. A list-based stack should be easier to create than a linked list as you don't have to do any lookups or insertions/removals from the middle. Start with a singly linked list as the base and see if you can figure it out.

Answer 2

can't solve it
need help

Answer 3

ooh okay
thanks