수다닷컴

질문 제목 : 자료구조 리스트 부분하고 있다 더블포인터를 포인터 함수로 바꾸는건데..
막히네요..ㅠㅠ 어떻해 밑 요약에 있는거처럼 바꿀수잇을까용 ?void insert_node(listnode **phead, listnode *p, listnode *new_node) 함수를
void insert_node(listheadnode *phead, listnode *p, listnode *new_node)로 구현

typedef struct listheadnode {
struct listnode *headlink;
} listheadnode;

질문 내용 :

#include stdio.h
#include malloc.h
#include stdlib.h
#include limits.h
#define false 0
#define true 1
typedef int element;
typedef struct listnode {
element data;
struct listnode *link;
} listnode;
typedef struct {
listnode *head;
int length;
} listtype;
void insert_node(listnode **phead, listnode *p,
listnode *new_node)
{
if( *phead == null ){
new_node-link = null;
*phead = new_node;
}
else if( p == null ){
new_node-link = *phead;
*phead = new_node;
}
else {
new_node-link = p-link;
p-link = new_node;
}
}
void remove_node(listnode **phead, listnode *p, listnode *removed)
{
if( p == null )
*phead = (*phead)-link;
else
p-link = removed-link;
free(removed);
}
void init(listtype *list)
{
if( list == null ) return;
list-length = 0;
list-head = null;
}
listnode *get_node_at(listtype *list, int pos)
{
int i;
listnode *tmp_node = list-head;
if( pos 0 ) return null;
for (i=0; ipos; i++)
tmp_node = tmp_node-link;
return tmp_span c_node;
}
int get_length(listtype *list)
{
return list-length;
}
void error(char *message)
{
fprintf(stderr,%s\n,message);
exit(1);
}
void add(listtype *list, int position, element data)
{
listnode *p;
if ((position = 0) && (position = list-length)){
listnode*node= (listnode *)malloc(sizeof(listnode));
if( node == null ) error(메모리 할당에러);
node-data = data;
p = get_node_at(list, position-1);
insert_node(&(list-head), p, node);
list-length++;
}
}
void add_last(listtype *list, element data)
{
add(list, get_length(list), data);
}
void add_first(listtype *list, element data)
{
add(list, 0, data);
}
int is_empty(listtype *list)
{
if( list-head == null ) return 1;
else return 0;
}
void delete(listtype *list, int pos)
{
if (!is_empty(list) && (pos = 0) && (pos list-length)){
listnode *p = get_node_at(list, pos-1);
remove_node(&(list-head),p,(p!=null)?p-link:null);
list-length--;
}
}
element get_entry(listtype *list, int pos)
{
listnode *p;
if( pos = list-length ) error(위치 오류);
p = get_node_at(list, pos);
return p-data;
}
void clear(listtype *list)
{
int i;
for(i=0;ilist-length;i++)
delete(list, i);
}
void display(listtype *list)
{
int i;
listnode *node=list-head;
printf(( );
for(i=0;ilist-length;i++){
printf(%d ,node-data);
node = node-link;
}
printf( )\n);
}
int is_in_list(listtype *list, element item)
{
listnode *p;
p = list-head;
while( (p != null) ){
if( p-data == item )
break;
p = p-link;
}
if( p == null) return false;
else return true;
}
int main()
{
listtype list1;
init(&list1);
add(&list1, 0, 20);
add_last(&list1, 30);
add_first(&list1, 10);
add_last(&list1, 40);
display(&list1);
delete(&list1, 3);
display(&list1);
delete(&list1, 0);
display(&list1);
printf(%s\n, is_in_list(&list1, 20)==true ? 성공: 실패);
printf(%d\n, get_entry(&list1, 0));
}

신청하기