Stack works in a LIFO order. It supports insert, remove, iteration and test for empty operations.
They can be represented using array. An initial capacity for this array is taken as input. We manipulate an index variable for push and pop, instead of actually deleting items from stack.
If using objects in stack, avoid loitering(holding references to objects and preventing GC) by using following code in pop operation:
public String pop() { String item = s[--N]; s[N] = null; return item; }
Following is the complete program:
They can be represented using array. An initial capacity for this array is taken as input. We manipulate an index variable for push and pop, instead of actually deleting items from stack.
If using objects in stack, avoid loitering(holding references to objects and preventing GC) by using following code in pop operation:
public String pop() { String item = s[--N]; s[N] = null; return item; }
Following is the complete program:
Related Posts:
No comments:
Post a Comment