单链表的头插尾插

秘制酱香烤鸭 2019-09-14 12:42:53

#include<stdio.h>
#include<malloc.h>
typedef struct node//规范节点形式
{
char name[20];
int id;
struct node* next;//指向下一节点
}NODE;
//初始化
NODE* init()
{
NODE* p = (NODE*)malloc(sizeof(NODE));//申请一个节点(节点p)
p->next = NULL;//next为p指针域存放的指针
return p;
}
//插入
void insert(NODE* head, NODE data)
{
NODE*p= (NODE*)malloc(sizeof(NODE));
*p = data;
//指针的赋值头插
//p->next = head->next;//新节点的下一个是头节点的下一个
//head->next=p;
//尾插
NODE* q = head;
while (q->next != NULL)
{
q = q->next;
}
p->next = q->next;
q->next = p;
}
}
int main()
{
NODE* head = init();//
NODE myNODE;
while (1)
{
scanf("%d %s", &myNODE.id, myNODE.name);
if (myNODE.id == 0)break;

insert(head, myNODE);
}
printf(head);
getchar();
return 0;
}

...全文