#include<stdio.h>
#include<stdlib.h>
typedef int DataType;
typedef struct Node{
DataType data;
struct Node *next;
}List;
#define Num 3
List* InitList();
void CreateListHead(List *l, int n);
void CreateListTail(List *l, int n);
int Length(List *l);
void TraverseList(List *l);
int Find(List *l, DataType d);
void Insert(List *l, int n, DataType data);
void Delete(List *l, int n);
void ClearList(List *l);
void main()
{
int n, pos, input;
List *l;
l = InitList();
/*CreateListHead(l, Num);
printf("线性表的长度是%d\n", Length(l));
TraverseList(l);*/
CreateListTail(l, Num);
printf("线性表的长度是%d\n", Length(l));
TraverseList(l);
//printf("%d %d %d %d\n", l->data, l->next->data, l->next->next->data, l->next->next->next->data);//分别打印各个节点的数据域
printf("请输入要查找的元素:");
scanf_s("%d", &input);
printf("要
#include<stdio.h>
#include<stdlib.h>
typedef int DataType;
typedef struct Node{
DataType data;
struct Node *next;
}List;
#define Num 3
List* InitList();
void CreateListHead(List *l, int n);
void CreateListTail(List *l, int n);
int Length(List *l);
void TraverseList(List *l);
int Find(List *l, DataType d);
void Insert(List *l, int n, DataType data);
void Delete(List *l, int n);
void ClearList(List *l);
void main()
{
int n, pos, input;
List *l;
l = InitList();
/*CreateListHead(l, Num);
printf("线性表的长度是%d\n", Length(l));
TraverseList(l);*/
CreateListTail(l, Num);
printf("线性表的长度是%d\n", Length(l));
TraverseList(l);
//printf("%d %d %d %d\n", l->data, l->next->data, l->next->next->data, l->next->next->next->data);//分别打印各个节点的数据域
printf("请输入要查找的元素:");
scanf_s("%d", &input);
printf("要