Java Program To Implement Stack Using Array
Chapter:
Interview Programs
Last Updated:
30-10-2016 16:14:33 UTC
Program:
/* ............... START ............... */
public class JavaStackUsingArray {
private static final int capacity = 3;
int arr[] = new int[capacity];
int top = -1;
public void push(int pushedElement) {
if (top < capacity - 1) {
top++;
arr[top] = pushedElement;
System.out.println("Element " + pushedElement + " is pushed to Stack !");
printElements();
} else {
System.out.println("Stack Overflow !");
}
}
public void pop() {
if (top >= 0) {
top--;
System.out.println("Pop operation done !");
} else {
System.out.println("Stack Underflow !");
}
}
public void printElements() {
if (top >= 0) {
System.out.println("Elements in stack :");
for (int i = 0; i <= top; i++) {
System.out.println(arr[i]);
}
}
}
public static void main(String[] args) {
JavaStackUsingArray stackDemo = new JavaStackUsingArray();
stackDemo.pop();
stackDemo.push(23);
stackDemo.push(2);
stackDemo.push(73);
stackDemo.push(21);
stackDemo.pop();
stackDemo.pop();
stackDemo.pop();
stackDemo.pop();
}
}
/* ............... END ............... */
Output
Stack Underflow !
Element 23 is pushed to Stack !
Elements in stack :
23
Element 2 is pushed to Stack !
Elements in stack :
23
2
Element 73 is pushed to Stack !
Elements in stack :
23
2
73
Stack Overflow !
Pop operation done !
Pop operation done !
Pop operation done !
Stack Underflow !
Notes:
-
Stack is abstract data type which demonstrates Last in first out (LIFO) behavior.
Tags
Implement Stack Using Array, Java, Interview Programs