链表的基本操作

biopunk

于 2015-08-03 22:02:58 发布

阅读量410

点赞数

CC 4.0 BY-SA版权

分类专栏： c++基础文章标签：链表指针

本文链接：https://blog.csdn.net/Biopunk/article/details/47146893

c++基础专栏收录该内容

1 篇文章

订阅专栏

本文介绍了如何使用C语言定义结构体来表示链表节点，并通过读取输入创建链表，然后遍历链表输出节点值。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

定义指针的结构体

struct data
{
    int x; //这是数据
    struct data *next;
};

typedef struct data * dataNode;

创建链表

dataNode read()
{
    struct data *node0, *node1, *head;
    node0 = new data;
    node1 = new data;
    head  = new data;//分配指针空间
    node0 = node1 = head = NULL;

    scanf("%d", &node0 -> x);
    node0 -> next = node1;
    head = node0;
    while (node0 -> x > 0) //这里写退出条件
    {
        scanf("%d", &node1 -> x);
        node0 = node1;
        node1 = new data;
        node0 -> next = node1;
    }
    node1 -> next = NULL;

    node0 = NULL;
    node1 = NULL; //释放指针
    delete node0;
    delete node1;


    return head;//返回头指针
}

遍历链表

void outp(dataNode head)
{
    struct data *st;
    st = NULL;
    st = new data;
    st = head;
    while (NULL != st -> next)
    {
        cout << st -> x << endl; //遍历操作
        st = st -> next;
    }
    st = NULL;
    delete st;
    return ;
}