Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- struct nod{
- int info;
- nod *urm;}*prim,*ultim;
- void adaugare(int n){
- while(n)
- {
- nod *p=new nod;
- ultim->urm=p;
- cout<<"Dati o valoare: ";
- ultim=p;
- p->urm=ultim;
- cin>>ultim->info;
- n--;
- ultim->urm=NULL;
- }
- }
- void afisare(){
- nod *p=prim;
- while(p!=NULL)
- {
- cout<<p->info<<" ";
- p=p->urm;
- }
- }
- int cautare(int x){
- nod *p=new nod;
- p=prim;
- while(p!=NULL){
- if(p->info==x)
- return 1;
- p=p->urm;}
- return 0;
- }
- int stergere(int x){
- nod *p=prim;
- nod *q;
- if(p->info==x){
- prim=p->urm;
- q=p;
- delete q;
- return 0;}
- while(p->urm!=NULL){
- if(p->urm->info==x){
- q=p->urm;
- p->urm=p->urm->urm;
- delete q;
- return 0;}
- q=p;
- p=p->urm;}
- if(p->info==x){
- ultim=q;
- delete p;
- ultim->urm=NULL;
- return 0;}
- return 0;
- }
- int stergerelista(){
- nod *p=prim;
- nod *q;
- while(p->urm!=NULL){
- q=p;
- p=p->urm;
- delete q;}
- }
- int main(){
- int n,x;
- cout<<"Dati n: ";
- cin>>n;
- prim=new nod;
- ultim=prim;
- cout<<"Dati o valoare: ";
- cin>>prim->info;
- prim->urm=ultim;
- ultim->urm=NULL;
- adaugare(n-1);
- afisare();
- cout<<endl<<"Dati x: ";cin>>x;
- if(cautare(x))
- cout<<"Am gasit x";
- else cout<<"Nu am gasit x";
- stergere(x);
- cout<<endl<<"Dupa stergere : ";
- afisare();
- stergerelista();
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement