Pregled posta

povezana lista zadatak brisanje,unos,ispis,sort-uzlazni

#include
using namespace std;

struct node{
int data;
node *link; };

void ispis(node *head);
void unos(node *&head);
void brisi(node *&head);

int main()
{
node *head=0;
int odg;
do{
cout<<"\nIzbornik.";
cout<<"\n1.Unos elementa.";
cout<<"\n2.Ispis liste.";
cout<<"\n3.Brisanje elementa.";
cout<<"\n4.Izlaz.";
cout<<"\nOdgovor: ";
cin>>odg;

switch(odg)
{
case 1:
unos(head);
break;
case 2:
cout<<"\nElementi liste.\n";
ispis(head);
break;
case 3:
brisi(head);
break;
case 4:
cout<<"\nBok.";
break;
default:
cout<<"\nNepostojeci unos";
}
}while(odg!=4);
//dealokacija
node *temp;
while(head)
{
temp=head;
head=head->link;
delete temp;
}
temp=head=NULL;

cin.sync();
cin.get();
return 0; }
void brisi(node *&head)
{
int elt;
cout<<"\nKoji element zelis obrisat? ";
cin>>elt;

node *traverse=head, *pre=0;
while (traverse)
{
if (traverse->data==elt) break;
pre=traverse;
traverse=traverse->link;
}
if (traverse)
{
if (pre==0) head=head->link;
else pre->link=traverse->link;
delete traverse;
traverse=0;
}
}
void unos(node *&head)
{
int n;
node *temp=head,*pre=0,*curr=new node;

cout<<"\nUnesi element: ";
cin>>n;
curr->data=n;

while(temp && temp->data pre=temp;
temp=temp->link;
}

if(pre){
curr->link=pre->link;
pre->link=curr;
}
else{
curr->link=head;
head=curr;
}
}

void ispis(node *head)
{ while(head)
{
cout<data<<" ";
head=head->link;
} }


Post je objavljen 04.06.2012. u 19:59 sati.