C语言头插法与尾插法创建单链表
用带头结点的链表为例
尾插法: 参考之前文章C语言单链表的入门学习,将新建结点加到单链表的表尾。新建一个尾指针tail
,使其指向当前链表的表尾(称为先进先出链表或“队列”,即最先建立的结点为链头,最后建立的结点为链尾)。
tail->next = p;
tail = p;
头插法: 从一个空表开始,不断读入数据,生成新的结点,将新结点插入到头结点之后,直至读入结束标志为止(称为后进先出链表或“栈”,即最后建立的结点为链头,最先建立的结点为链尾)。
p->next = head->next;
head->next = p;
尾插法具体函数实现
node * createHeadList(void)
{
int n;
node * head, *tail, *p;
//创建头结点
p = (node *)malloc(sizeof(node));
p->next = NULL;
head = p;
tail = p;
while(scanf("%d",&n) == 1)
{
p = (node *)malloc(sizeof(node));
p->num = n;
p->next =NULL;
tail->next = p;
tail = p;
}
return head;
}
头插法具体函数实现
node * createHeadList2(void)
{
int n;
node * head, *p;
p = (node *)malloc(sizeof(node));
p->next = NULL;
head = p;
while(scanf("%d",&n) == 1)
{
p = (node *)malloc(sizeof(node));
p->num = n;
p->next = head->next;
head->next = p;
}
return head;
}