-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathstack_using_SLL.cpp
More file actions
127 lines (109 loc) · 2.52 KB
/
stack_using_SLL.cpp
File metadata and controls
127 lines (109 loc) · 2.52 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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
//Program to implement a Stack using two Singly Linked List
#include<iostream>
#include<cstdlib>
#include"SLL.cpp"
using namespace std;
class stack{
SLinkedList<int> sll;
int curr_size;
public:
stack();
void push(int);
void pop();
int top();
bool isEmpty();
void stack_status();
};
stack::stack(){
curr_size = 0;
}
void stack::push(int ele){
/*
Objective: To push an element onto the stack.
Input: ele -> The element to be pushed
Output: None
Return value: None
*/
sll.addFront(ele);
curr_size++;
}
bool stack::isEmpty(){
if(sll.empty())
return true;
else
return false;
}
void stack::pop(){
/*
Objective: To pop the top element out of the stack.
Input: None
Output: None
Return value: top element, if stack is not empty
NULL, if stack is empty
*/
if(!isEmpty()){
curr_size--;
sll.removeFront();
}
}
int stack::top(){
/*
Objective: To find the top element of the stack.
Input: None
Output: None
Return value: top element, if stack is not empty
NULL, if stack is empty
*/
if( !isEmpty() )
return sll.front();
}
void stack::stack_status(){
/*
Objective: To print the stack
Input: None
Output: Stack data
Return value: None
*/
cout<<"\n\n-------------------------Stack---------------------------\n";
sll.print();
cout<<"\n----------------------------------------------------------";
}
int main(){
/*
Objective: To perform various stack operations.
*/
stack s;
int choice;
while(1){
cout<<"\n\n\t\t\tSTACK OPERATIONS\n\n1.PUSH\n2.POP\n3.TOP\n4.PRINT STACK\n5.EXIT\n\n";
cout<<"\nEnter your choice : ";
cin>>choice;
switch(choice){
case 1: cout<<"\nEnter element: ";
int ele;
cin>>ele;
s.push(ele);
s.stack_status();
break;
case 2: if(!s.isEmpty()){
s.pop();
cout<<"\nElement popped!!";
}
else
cout<<"\nStack empty!!Cannot pop!!";
s.stack_status();
break;
case 3: if(!s.isEmpty())
cout<<"\nTop element: "<<s.top();
else
cout<<"\nStack is empty!!";
break;
case 4: s.stack_status();
break;
case 5: exit(0);
default: cout<<"Invalid choice!!";
break;
}
}
return 0;
}