Implement stack using Linked List in java data structure and algorithm in data structure and algorithm

Implement stack using Linked List in java data structure and algorithm in data structure and algorithm


The stack is an abstract data type that demonstrates Last in first out (LIFO) behavior. We will implement the same behavior using Linked List.
There are two most important operations of Stack:

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

Java Program:

Let's create a java program to create a 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);
}
}

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