수다닷컴

#include iostream.h
#include string.h

struct DATA{
int data;
DATA *next;
};
class data_list
{
public:
DATA *head;
data_list()
{
head = new DATA;

head-next=NULL;

}
~data_list(){};
void Insert(int data);
void Delete();
void Display();
};
void data_list::Insert(int data)
{
DATA *current;
current=head;

while(1)
{
if(current-next == NULL)
{
current-data = data;
current-next = new DATA;
current-next-next =NULL;

break;
}

else
current=current-next;
}
}

/*
void data_list::Insert(int data)
{
DATA *current;
current = head;
while(1)
{
if(current-next == NULL)
{
current-data = data;
current-next = new DATA;
current-next-next =NULL;
break;
}

else
current=current-next;}
}*/

void data_list::Delete()
{

while(head!=NULL)
{DATA *current;
current = head-next;
delete head;
cout freeendl;
head=current;}
}
void data_list::Display()
{
DATA *current;
current = head;
while(1)
{
if(current-next == NULL){
return;
break;
}
else// list에 node가 존재할 경우
{
cout current-data endl;
current = current-next;
}
}
}
void main()
{
data_list list;
int data;
while(1)
{
cout Input data? (0 to exit): ;
cin data;

if(data == 0)
break;
list.Insert(data);
}

list.Display();
list.Delete();
cout endl;
}

정렬을 어떻게 구현해야할지 모르겠네요,에러만나구요ㅜ

신청하기