Stack implementation using a linked list.Linked list implementation of stack is efficient than array implementation because it does not reserve memory in advance. A stack is a container to which objects are added and removed by following last-in-first-out strategy. To insert objects into and remove from stack a pointer usually called top is maintained that points to last inserted item. However, in linked implementation of stack we don't exactly require the top pointer because we will add an item at the beginning of the list and remove it from the beginning of the list.

1. WELCOME
U A P C S E
Linked List with Stack in JAVA
Aboutme
Topic
LL
Stack
WorkFlow
Code

2. Aboutme
Topic
LL
Stack
WorkFlow
Code
MESSAGE FROM
Md. Moshiur Rahman Hridoy
ID : 17101016
Section :A

3. Aboutme
Topic
LL
Stack
WorkFlow
Code
321
Linked List
What is Linked
List
Stack
What is Stack
How
Can We Connected
Linked List & stack.

4. Aboutme
Topic
LinkedList
Stack
WorkFlow
Code
Data 1 Data 2 Data 3

5. about
Topic
LL
Stack
WorkFlow
Code
What is Stack
Stack
Overflow
Stack Under
Flow
01 02 03
LIFO
A stack is a container of
objects that are inserted and
removed according to the last-
in first-out (LIFO) principle. In
the pushdown stacks only two
operations are allowed: push
the item into the stack, and pop
the item out of the stack
Exceeded memory
A stack overflow error can
occur in a computer program
due to excessive memory
usage.
Element doesn’t exist
An error condition that occurs
when an item is called for from
the stack, but the stack is
empty.

7. about
Topic
LL
Stack
WorkFlow
Code

8. Aboutme
Topic
LL
Stack
WorkFlow
Code
class Stack
{
static final int MAX = 1000;
int top;
int a[] = new int[MAX]; // Maximum
size of Stack
boolean isEmpty()
{
return (top < 0);
}
Stack()
{
top = -1;
}
boolean push(int x)
{
if (top >= MAX)
{
System.out.println("Stack Overflow");
return false;
}
else
{
a[++top] = x;
return true;
}
}
int pop()
{
if (top < 0)
{
System.out.println("Stack
Underflow");
return 0;
}
else
{
int x = a[top--];
return x;
}
}
class Main
{
public static void main(String args[])
{
Stack s = new Stack();
s.push(10);
s.push(20);
s.push(30);
System.out.println(s.pop() + " Popped from stack");
}
}