Q:

Java program to get the topmost element from Stack collection without removing it

belongs to collection: Java Stack Programs

0

Java program to get the topmost element from Stack collection without removing it

All Answers

need an explanation for this answer? contact us directly to get an explanation for this answer

Program/Source Code:

The source code to get the topmost element from the Stack collection without removing it is given below. The given program is compiled and executed successfully.

// Java program to get the topmost element from Stack collection 
// without removing it

import java.io.*;
import java.util.*;

public class Main {
  public static void main(String[] args) {
    Stack cars = new Stack();

    cars.push("Maruti");
    cars.push("Tata");
    cars.push("Hundai");
    cars.push("Honda");

    System.out.println("Elements from top of Stack: " + cars.peek());
    System.out.println("Stack elements: \n" + cars);
  }
}

Output:

Elements from top of Stack: Honda
Stack elements: 
[Maruti, Tata, Hundai, Honda]

Explanation:

In the above program, we imported the "java.io.*" and "java.util.*" packages to use the Stack collection class. Here, we created a class Main. The Main class contains a main() method. The main() method is the entry point for the program.

In the main() method, we created a Stack collection and add elements to it. Then we got an element from the TOP of the stack using the peek() method and printed the result.

 

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)

Java program to compare two Stack collections... >>
<< Java program to check whether a Stack collection i...