无头链表封装方式

#include<stsio.h>
#include<stdlib.h>
使用二级指针方法
无头链表:第一个节点中存放了数据
struct Node
{
int data;
struct Nodenext;
};
struct NodecreateNode(int data)
{
structNodenewNode=(struct Node)malloc(sizeof(struct Node));
newNode->data=data;
newNode->next=NULL;
return newNode;
}
void insertByHead(struct Node**list,int data)
{

 struct  Node*newNode=createNode(data);
 newNode->next=(*list);
 (*list)=newNode;

}

void printfList(struct Nodelist)
{
structNodepMove=list;
while(pMove)
{
printf("%d\t",pMove->data);
pMove=pMove->next;
}
printf("\n");
}

int main()
{
用个指针指向表头,表示整个链表
list永远指向表头
struct Node*list =NULL;
insertByHead(&list,1);
insertByHead(&list,2);
insertByHead(&list,3);
printfList(list);
}

用结构体封装的去描述一种结构
#include<stdio.h>
#include<stdlob.h>
struct Node
{

  int  data;
  struct   Node*next;
  
  };
  struct  Node*createNode(int  data)
  {
  struct  Node*newNode=(struct   Node*)malloc(struct  Node));
  newNode->data=data;
  newNode->next=NULL;
  return  newNode;

}

  结构体描述链表

struct List
{

抽象一种结构属性,共有属性
struct NodefrontNode;
struct NodetailNode;
int size;
};

创建链表
struct List * createList()
{
struct List *list=(structList 星号※)malloc(sizeof(struct List));
list ->frontNode=list->frontNode=NULL;
list->size=0;
return list;
}
void insertNodeByHead(struct List *list,int data)
{

struct Node*newNode=createNode(data);
if(list->size==0)第一个表头既是表尾也是表头节点
{
list->frontNode=newNode;
list->tailNode=newNode;
else
list->tailNode->next=newNode;
list->tailNode=newNode;
list->size++;
}

void peintList(struct List* list)
{

struct Node*pMove=list->frontNode;
while(pMove)
{
printf("%d",pMove->data);
pMove=pMove->next;
}
printf("\n");
}

int main()
{
struct List*list=createList();
return 0;
}