Stack Using Linked List (1) Edit
Stack Using Linked List (1) Edit
Roll no: 13
#include <iostream>
struct Node {
int data;
};
newnode->data = val;
newnode->next = top;
top = newnode;
void pop() {
if(top==NULL)
cout<<"Stack Underflow"<<endl;
else {
top = top->next;
void display() {
if(top==NULL)
cout<<"stack is empty";
else {
ptr = top;
ptr = ptr->next;
cout<<endl;
int main() {
cout<<"4) Exit"<<endl;
do {
cin>>ch;
switch(ch) {
case 1: {
cin>>val;
push(val);
break;
case 2: {
pop();
break;
case 3: {
display();
break;
}
case 4: {
cout<<"Exit"<<endl;
break;
default: {
cout<<"Invalid Choice"<<endl;
}while(ch!=4);
return 0;
Output: