Phead 链表

最新推荐文章于 2022-11-07 20:07:46 发布

m0_58629119

最新推荐文章于 2022-11-07 20:07:46 发布

阅读量230

点赞数

分类专栏：笔记

本文链接：https://blog.csdn.net/m0_58629119/article/details/127028639

版权

C语言链表数据结构插入操作打印函数

关键词由CSDN通过智能技术生成

笔记专栏收录该内容

26 篇文章 0 订阅

订阅专栏

#pragma once

#include<stdio.h>
#include<stdlib.h>
typedef int SLTDateType;

typedef struct SListNode {
SLTDateType data;
struct SListNode* next;
}SLTNode;

void SListPrint(SLTNode* phead);//create一个头节点
void SListPushBack(SLTNode** phead, SLTDateType x);

#include"SList.h"

void SListPrint(SLTNode* phead) {
   SLTNode* cur = phead;
   while (cur != NULL) {
       printf("%d->", cur->data);
       cur = cur -> next;
   }
}
void SListPushBack(SLTNode** phead, SLTDateType x) {
   /*SLTNode* tail = phead;
   while (tail->next != NULL) {
       tail = tail->next;
   }*/
   SLTNode* newnode = (SLTNode*)malloc(sizeof(SLTNode));
   newnode->data = x;
   newnode->next = NULL;
   if (*phead == NULL) {
       *phead = newnode;
   }
   else {
       SLTNode* tail = *phead;
       while (tail->next != NULL) {
           tail = tail->next;
       }
       tail->next = newnode;
   }

}

#include"SList.h"
void Test() {
   SLTNode* plist = NULL;//plist,头指针
   SListPushBack(&plist,1);
   SListPushBack(&plist, 2);
   SListPushBack(&plist, 3);
   SListPushBack(&plist, 4);

   SListPrint(plist);
}
int main() {
   Test();
   return 0;
}