Java Program to Implement Stack API

This Java program Implements Stack API.The Stack class represents a last-in-first-out (LIFO) stack of objects. It extends class Vector with five operations that allow a vector to be treated as a stack. The usual push and pop operations are provided, as well as a method to peek at the top item on the stack, a method to test for whether the stack is empty, and a method to search the stack for an item and discover how far it is from the top.

Here is the source code of the Java Program to Implement Stack API.The Java program is successfully compiled and run on a Linux system. The program output is also shown below.

import java.util.Stack;
 
public class StackImpl<E>
{
    private Stack<E> stack;
 
    /** Creates an empty Stack. **/
    public StackImpl()
    {
        stack = new Stack<E>();
    }
 
    /** Tests if this stack is empty. **/
    public boolean empty()
    {
        return stack.empty();
    }
 
    /**
     * Looks at the object at the top of this stack without removing it from the
     * stack.
     **/
    public E peek()
    {
        return stack.peek();
    }
 
    /**
     * Removes the object at the top of this stack and returns that object as
     * the value of this function.
     **/
    public E pop()
    {
        return stack.pop();
    }
 
    /** Pushes an item onto the top of this stack. **/
    public E push(E item)
    {
        return stack.push(item);
    }
 
    /** Returns the 1-based position where an object is on this stack. **/
    public int search(Object o)
    {
        return stack.search(o);
    }
 
    public static void main(String...arg)
    {
        StackImpl<Integer> stack = new StackImpl<Integer>();
        System.out.println("element pushed : " + stack.push(3));
        System.out.println("element pushed : " + stack.push(4));
        System.out.println("element pushed : " + stack.push(-19));
        System.out.println("element pushed : " + stack.push(349));
        System.out.println("element pushed : " + stack.push(35));
        System.out.println("element poped : " + stack.pop());
        System.out.println("element poped : " + stack.pop());
        System.out.println("Element peek : " + stack.peek());
        System.out.println("position of element 349 " + stack.search(3));
        while (!stack.empty())
        {
            System.out.println("element poped : " + stack.pop());
        }
    }
}
$ javac StackImpl.java
$ java StackImpl
element pushed : 3
element pushed : 4
element pushed : -19
element pushed : 349
element pushed : 35
element poped : 35
element poped : 349
Element peek : -19
position of element 349 3
element poped : -19
element poped : 4
element poped : 3

Related posts:

Java Program to Implement Expression Tree
Java Program to Implement Traveling Salesman Problem using Nearest neighbour Algorithm
HttpClient Basic Authentication
String Processing with Apache Commons Lang 3
Java Program to Check whether Graph is a Bipartite using BFS
Java Program to Implement Doubly Linked List
HttpAsyncClient Tutorial
Xử lý ngoại lệ đối với trường hợp ghi đè phương thức trong java
Introduction to Spring Security Expressions
Java Program to Compute Determinant of a Matrix
Entity To DTO Conversion for a Spring REST API
Hướng dẫn Java Design Pattern – Decorator
Connect through a Proxy
Introduction to Spring Data REST
Java Collections Interview Questions
Abstract class và Interface trong Java
Working with Tree Model Nodes in Jackson
Java Program to Evaluate an Expression using Stacks
Hướng dẫn Java Design Pattern – Command
Java Program to Find kth Smallest Element by the Method of Partitioning the Array
Spring Boot - Thymeleaf
Deploy a Spring Boot App to Azure
Java Program to Implement Sieve Of Sundaram
Spring 5 Functional Bean Registration
Java Program to Permute All Letters of an Input String
A Guide to TreeMap in Java
Java Program to Perform Sorting Using B-Tree
Java Program to Find k Numbers Closest to Median of S, Where S is a Set of n Numbers
Java Concurrency Interview Questions and Answers
Java Program to Find SSSP (Single Source Shortest Path) in DAG (Directed Acyclic Graphs)
Spring @RequestMapping New Shortcut Annotations
Java Program to Implement Wagner and Fisher Algorithm for online String Matching