1 / 7

Inserarea unui element intr -o lista

Inserarea unui element intr -o lista. Inserarea unui nou element se poate face: La inceput ul listei La sfarsit ul listei In interiorul listei : - inainte de nodul cu valoare x - dupa nodul cu valoare x - pe pozitia k.

ata
Download Presentation

Inserarea unui element intr -o lista

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Inserareaunui element intr-o lista

  2. Inserareaunuinou element se poate face: • La inceputullistei • La sfarsitullistei • In interiorullistei: -inainte de nodul cu valoare x -dupanodul cu valoare x -pepozitia k.

  3. Inserareanodului cu valoarea y La inceput La sfarsit Void inserare(int y){ nod *nou; nou=new nod; nou->info=y; nou->urm=prim; prim=nou;} Void inserare(int y){ nod *nou; nou=new nod; nou=prim; while(nou!=NULL) nou=nou->urm; nou->info=y; nou->urm=NULL;}

  4. Inserareaunui nod in interiorullistei 1 2 1.5

  5. Inserareanodului cu valoarea y inainteanodului cu valoarea x Void inserare(intx,int y){ nod *p,*nou; if(prim->info==x){ nou=new nod; nou->info=y; nou->urm=prim; prim=nou;} else{p=prim; while(p->urm->info!=x) p=p->urm; nou=new nod; nou->info=y; nou->urm=p->urm; p->urm=nou;} }

  6. Inserareanodului cu valoarea y dupanodul cu valoarea x Void inserare(intx,int y){ nod *p,*nou; if(prim->info==x){ nou=new nod; nou->info=y; nou->urm=prim; prim=nou;} else{p=prim; while(p->urm->info!=x) p=p->urm; p=p->urm; nou=new nod; nou->info=y; nou->urm=p->urm; p->urm=nou;} }

  7. Inserareanodului cu valoarea y pepozitia k Void inserare(intk,int y){ nod *p,*nou; if(k==1){ nou=new nod; nou->info=y; nou->urm=prim; prim=nou;} else{p=prim; while(k!=2) {p=p->urm;k--;} nou=new nod; nou->info=y; nou->urm=p->urm; p->urm=nou;} }

More Related