Implement stack using Linked List in java

If you want to practice data structure and algorithm programs, you can go through 100+ java coding interview questions.

In this program, we will see how to implement stack using Linked List in java.
The Stack is an abstract data type that demonstrates Last in first out (LIFO) behavior. We will implement the same behavior using Linked List.
Stack
There are two most important operations of Stack:

Push : We will push element to beginning of linked list to demonstrate push behavior of stack.
Pop : We will remove first element of linked list to demonstrate pop behavior of Stack .

Java Program:

Lets create a java program to create stack using Linked List.

package org.arpit.java2blog;

public class LinkedListStack {
    private Node head; // the first node

    // nest class to define linkedlist node
    private class Node {
        int value;
        Node next;
    }

    public LinkedListStack() {
        head = null;
    }

    // Remove value from the beginning of the list for demonstrating behaviour of stack
    public int pop() throws LinkedListEmptyException {
        if (head == null) {
            throw new LinkedListEmptyException();
        }
        int value = head.value;
        head = head.next;
        return value;
    }

    // Add value to the beginning of the list for demonstrating behaviour of stack
    public void push(int value) {
        Node oldHead = head;
        head = new Node();
        head.value = value;
        head.next = oldHead;
    }

    public static void main(String args[]) 
    {
        LinkedListStack lls=new LinkedListStack();
        lls.push(20);
        lls.push(50);
        lls.push(80);
        lls.push(40);
        lls.push(60);
        lls.push(75);
        System.out.println("Element removed from LinkedList: "+lls.pop());
        System.out.println("Element removed from LinkedList: "+lls.pop());
        lls.push(10);
        System.out.println("Element removed from LinkedList: "+lls.pop());
        printList(lls.head);
    }
    public static void printList(Node head) {
        Node temp = head;
        while (temp != null) {
            System.out.format("%d ", temp.value);
            temp = temp.next;
        }
        System.out.println();
    }
}

/**
 * 
 * Exception to indicate that LinkedList is empty.
 */

class LinkedListEmptyException extends RuntimeException {
    private static final long serialVersionUID = 1L;

    public LinkedListEmptyException() {
        super();
    }

    public LinkedListEmptyException(String message) {
        super(message);
    }
}

package org.arpit.java2blog;

public class LinkedListStack {

private Node head; // the first node

// nest class to define linkedlist node

private class Node {

int value;

Node next;

}

public LinkedListStack() {

head = null;

}

// Remove value from the beginning of the list for demonstrating behaviour of stack

public int pop() throws LinkedListEmptyException {

if (head == null) {

throw new LinkedListEmptyException();

}

int value = head.value;

head = head.next;

return value;

}

// Add value to the beginning of the list for demonstrating behaviour of stack

public void push(int value) {

Node oldHead = head;

head = new Node();

head.value = value;

head.next = oldHead;

}

public static void main(String args[])

{

LinkedListStack lls=new LinkedListStack();

lls.push(20);

lls.push(50);

lls.push(80);

lls.push(40);

lls.push(60);

lls.push(75);

System.out.println("Element removed from LinkedList: "+lls.pop());

lls.push(10);

System.out.println("Element removed from LinkedList: "+lls.pop());

printList(lls.head);

}

public static void printList(Node head) {

Node temp = head;

while (temp != null) {

System.out.format("%d ", temp.value);

temp = temp.next;

}

System.out.println();

}

/**

* Exception to indicate that LinkedList is empty.

class LinkedListEmptyException extends RuntimeException {

private static final long serialVersionUID = 1L;

public LinkedListEmptyException() {

super();

}

public LinkedListEmptyException(String message) {

super(message);

}

When you run above program, you will get below output:

Element removed from LinkedList: 75
Element removed from LinkedList: 60
Element removed from LinkedList: 10
40 80 50 20

That’s all about implement stack using Linked List in java.

Was this post helpful?

Let us know if this post was helpful. Feedbacks are monitored on daily basis. Please do provide feedback as that\'s the only way to improve.

Implement stack using Linked List in java

Java Program:

Was this post helpful?

Author

Leave a Reply Cancel reply

Categories

Popular Posts

Let’s be Friends

Java Program:

Was this post helpful?

Related posts:

Share this

Author

Leave a Reply Cancel reply

Let’s be Friends