Java: Remove all the elements from a stack

Last update on May 09 2025 12:50:21 (UTC/GMT +8 hours)

6. Remove all elements from a stack.

Write a Java program to remove all elements from a stack.

Sample Solution:

Java Code:

import java.util.Scanner;
public class Stack {
  private int[] arr;
  private int top;

  // Constructor to initialize the stack
  public Stack(int size) {
    arr = new int[size];
    top = -1;
  }

  // Method to push an element onto the stack
  public void push(int num) {
    if (top == arr.length - 1) {
      System.out.println("Stack is full");
    } else {
      top++;
      arr[top] = num;
    }
  }

  // Method to pop an element from the stack
  public int pop() {
    if (top == -1) {
      System.out.println("Stack Underflow");
      return -1;
    } else {
      int poppedElement = arr[top];
      top--;
      return poppedElement;
    }
  }

  // Method to get the top element of the stack
  public int peek() {
    if (top == -1) {
      System.out.println("Stack is empty");
      return -1;
    } else {
      return arr[top];
    }
  }

  // Method to check if the stack is empty
  public boolean isEmpty() {
    return top == -1;
  }

  public void removeAll() {
    top = -1;
  }

  public void display() {
    if (top == -1) {
      System.out.println("Stack is empty");
    } else {
      System.out.print("Stack elements: ");
      for (int i = top; i >= 0; i--) {
        System.out.print(arr[i] + " ");
      }
      System.out.println();
    }
  }

  public static void main(String[] args) {
    System.out.println("Initialize a stack:");
    Stack stack = new Stack(10);
    System.out.println("\nInput some elements on the stack:");
    stack.push(1);
    stack.push(3);
    stack.push(2);
    stack.push(0);
    stack.push(7);
    stack.push(5);
    stack.push(-1);
    stack.display();
    System.out.println("\nRemove all the elements from the stack:");
    stack.removeAll();
    System.out.println("Is the stack empty? " + stack.isEmpty());
  }
}

Sample Output:

Initialize a stack:

Input some elements on the stack:
Stack elements: -1 5 7 0 2 3 1

Remove all the elements from the stack:
Is the stack empty? true

Flowchart:

Flowchart: Java Exercises: Remove all the elements from a stack.

For more Practice: Solve these Related Problems:

Write a Java program to clear a stack by repeatedly popping elements until it is empty.
Write a Java program to implement a method that empties a stack and returns the number of elements removed.
Write a Java program to transfer all elements from one stack to another and then clear the original stack.
Write a Java program to use recursion to remove all elements from a stack and then verify that the stack is empty.

Go to:

PREV : Find the maximum and minimum elements in a stack.
NEXT : Count all the elements in a stack.

Live Demo:

Java Code Editor:

Improve this sample solution and post your code through Disqus