-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathstack_using_linked_list.java
More file actions
71 lines (65 loc) · 1.48 KB
/
Copy pathstack_using_linked_list.java
File metadata and controls
71 lines (65 loc) · 1.48 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
public class stack_using_linked_list
{
public class Node
{
int data;
Node next;
public Node(int data)
{
this.data=data;
this.next=null;
}
}
Node top;
int size;
public stack_using_linked_list()
{
this.top=null;
}
public boolean isEmpty()
{
if(top==null) return true;
return false;
}
public void push(int element)
{
Node new_node = new Node(element);
new_node.next = top;
top = new_node;
size++;
System.out.println("Element " + element + " pushed into stack");
}
public void pop()
{
if(isEmpty()) System.out.println("Stack is Empty! (Stack Underflow)");
else
{
int poppedElement = top.data;
top = top.next;
size--;
System.out.println("Popped element: " + poppedElement);
}
}
public void peek()
{
if(isEmpty()) System.out.println("Stack is Empty");
else System.out.println("Topmost element: " + top.data);
}
public void size()
{
System.out.println("Size of stack: " + size);
}
public static void main(String[] args)
{
stack_using_linked_list st = new stack_using_linked_list();
st.push(4);
st.push(2);
st.peek();
st.push(7);
st.size();
st.pop();
st.pop();
st.pop();
st.pop();
}
}