forked from super30admin/PreCourse-1
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathExercise_2.java
More file actions
97 lines (84 loc) · 2.14 KB
/
Exercise_2.java
File metadata and controls
97 lines (84 loc) · 2.14 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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
public class Exercise_2 {
StackNode root;
static class StackNode {
int data;
StackNode next;
StackNode(int data)
{
//Constructor here
this.data = data;
next = null;
}
}
public boolean isEmpty()
{
//Write your code here for the condition if stack is empty.
if(root==null)
return true;
else
return false;
}
public void push(int data)
{
//Write code to push data to the stack.
if(root==null)
{
root = new StackNode(data);
}
else{
StackNode temp = root;
while(temp.next!=null)
{
temp = temp.next;
}
temp.next = new StackNode(data);
}
}
public int pop()
{
//If Stack Empty Return 0 and print "Stack Underflow"
//Write code to pop the topmost element of stack.
//Also return the popped element
if(root==null){
System.out.println("Stack Underflow");
return 0;
}
else{
StackNode temp = root;
StackNode prevNode = new StackNode(-1);
while(temp.next!=null)
{
prevNode = temp;
temp = temp.next;
}
prevNode.next = null;
return temp.data;
}
}
public int peek()
{
//Write code to just return the topmost element without removing it.
if(root==null){
System.out.println("Stack is Empty");
return -1;
}
else{
StackNode temp = root;
while(temp.next!=null)
{
temp = temp.next;
}
return temp.data;
}
}
//Driver code
public static void main(String[] args)
{
Exercise_2 sll = new Exercise_2();
sll.push(10);
sll.push(20);
sll.push(30);
System.out.println(sll.pop() + " popped from stack");
System.out.println("Top element is " + sll.peek());
}
}