Неужели никто не знает про список?

#include <iostream.h>
#include <conio.h>
struct node
{
int num;
node *next;
};
node* toList(node* ,int);
void printList(node*);
void fun (node* head, int&);
void del (node* head,int max);
 
void main()
{
clrscr ();
int what,i,n;
node *head=0;
cout<<"input n=";
cin>>n;
cout<<endl;
int max=1;
cout<<"input all what"<<endl;
for (i=1;i<=n;i++)
{
cin>>what;
head = toList (head ,what);
if ( what>max)
max=what;
}
 
printList(head);
 
fun (head, max);
del (head,max);
 
printList(head);
 
getch();
}
node* toList(node* head ,int num)
{
node* pv=new node;
 
pv->num=num;
pv->next=0;
if (head)
{ node* cur=0;
if(head->num> pv->num)
{
pv->next=head;
head=pv;
}
else
{ cur=head;
while((cur->next) && (cur->next->num < pv->num))
cur=cur->next;
pv->next=cur->next;
cur->next=pv;
 
}
}
else
head=pv;
return head;
}
void fun (node* head, int&max)
{
 
node* pv,*temp;
temp->num=head->num;
temp->next=head->next;
head->next=temp;
 
head->num=max;
 
 
 
 
}
 
void del (node* head,int max)
{
while (head)
{
max=head->num;
head=head->next;
 
}
 
}
 
void printList(node* pv)
{
 while(pv!=NULL)
{
cout<<"="<<pv->num<<endl;
pv=pv->next;
}
cout<<endl;
}

void del(node * pw)
{
node * previos,current;
current = pw;
while(current->next != NULL)
{
previos = current;
current = previos->next;
}
previos->next = NULL;
delete current;
 
}