Professional Documents
Culture Documents
Computer Science
Computer Science
we can only push and pop the element on the top of the stack.
sequence of nodes.amortize time is the time needed to push or something in O(n).when stack is full,incrementing the stack by c takes O(n^2), whereas on doubling the size it takes O(n).