Stack Using Linked List
Stack Using Linked List
#include<iostream>
#include<conio.h>
class Node
private:
int data;
Node *next;
public:
void setData(int n)
data = n;
int getData()
return data;
next = ptr;
}
Node* getNext()
return next;
};
class Stack
private:
Node *head;
public:
Stack()
head = NULL;
void push(int n)
head = current;
void pop()
{
if(head == NULL)
else
delete ptr;
void display()
if(head == NULL)
else
void search(int n)
if(head == NULL)
else
int found=0;
while(ptr != NULL)
if(found == 0)
void update(int n)
if(head == NULL)
else
int found=0;
while(ptr != NULL)
cin>>n;
found++;
if(found == 0)
};
main()
Stack s;
p:
system("cls");
int choice,n;
cout<<"\n\n 1. Push";
cout<<"\n\n 2. Pop";
cout<<"\n\n 3. Display";
cout<<"\n\n 4. Search";
cout<<"\n\n 5. Update";
cout<<"\n\n 6. Exit";
cin>>choice;
switch(choice)
case 1:
cin>>n;
s.push(n);
break;
case 2:
s.pop();
break;
case 3:
s.display();
break;
case 4:
cin>>n;
s.search(n);
break;
case 5:
cin>>n;
s.update(n);
break;
case 6:
exit(0);
default:
getch();
goto p;
return 0;
Push
Display
Pop
Display Again
Search
Update
Display Again
Exit