链表动态创建之头/尾插法

本文介绍了如何使用C语言实现链表数据结构,包括从头创建链表、在头部和尾部插入节点,以及遍历并打印链表。通过实例展示了结构体Test的定义和insertFromHead、insertBehind等关键函数的用法。
摘要由CSDN通过智能技术生成

实现代码:

#include <stdio.h>
#include <stdlib.h>
struct Test
{
                int data;
                struct Test *next;
};

int printLink(struct Test *head)
{
                struct Test *point;
                point = head;
                while(point != NULL) {
                        printf("%d ",point->data);
                        point = point->next;
                }
                putchar('\n');
}
struct Test* insertFromHead(struct Test *head,struct Test *new)
{
                if(head == NULL) {
                        head = new;
                } else {
                        new->next = head;
                        head = new;
                }


                return head;
}
struct Test* insertBehind(struct Test *head,struct Test *new)
{
        struct Test *p = head;
        if(p == NULL) {
                head=new;
                return head;
        }
        while(p->next != NULL) {
                p = p->next;
        }
        p->next = new;
        return head;
}
struct Test *createLink(struct Test *head)
{
        struct Test *new;
        while(1) {
                new = (struct Test *)malloc(sizeof(struct Test));
                printf("input your new node data:\n");
                scanf("%d",&new->data);
                if(new->data == 0){
                        printf("0 quit\n");
                        return head;
                }
                head = insertFromHead(head,new);
        }
}
struct Test *createLink2(struct Test *head)
{
        struct Test *new;
        while(1) {
                new = (struct Test *)malloc(sizeof(struct Test));
                printf("input your new node data:\n");
                scanf("%d",&new->data);
                if(new->data == 0){
                        printf("0 quit\n");
                        return head;
                }
                head = insertBehind(head,new);
        }
}

int main()
{
        struct Test *head = NULL;
        head = createLink(head);
        printLink(head);
        struct Test t1 = {1000,NULL};
        head = insertFromHead(head,&t1);
        printLink(head);
        struct Test t2 = {2000,NULL};
        head = insertBehind(head,&t2);
        printLink(head);


        return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值