线性链表的实现（c语言）

#include "stdio.h"
#include "stdlib.h"
#define ElemType int
#define N 5


//结构体的定义
typedef struct LinkedList
{
ElemType Data;

struct LinkedList * Next;

}LinkedList;

int Listlength=N;

//在线性表最后插入结点
void Insert(LinkedList* curNode,LinkedList* newNode)
{
if(curNode!=NULL&&newNode!=NULL)
{
newNode->Next = curNode->Next;

curNode->Next = newNode;
}
else
{

printf(" 节点错误！");



}

}

//初始化线性表

void InitLinkedList(LinkedList* &head)
{
head = (LinkedList*)malloc(sizeof(LinkedList));


head->Next = NULL;
}


//构建线性表

void CreateListInEnd(LinkedList* head,ElemType data[],int len)
{
void FindEndNode(LinkedList* head,LinkedList* &findNode);

for(int i=0;i<len;i++)
{
LinkedList* p = (LinkedList*)malloc(sizeof(LinkedList));

p->Data = data[i];