#include <stdio.h>
#define NULL 0
#define TRUE 1
#define FALSE 0
#define ERROR -32768
typedef int ElemType;
typedef struct Node
{
ElemType data;
struct Node * next;
} NODE, *PNODE;
void InitList(PNODE *);
void AppendList(PNODE, ElemType);
int InsertList(PNODE, int, ElemType);
int DeleteList(PNODE, int, ElemType *);
void ListSort(PNODE);
int GetList(PNODE, int, ElemType *);
int IndexOf(PNODE, ElemType);
int IsEmptyList(PNODE);
int ListSize(PNODE);
void TraverseList(PNODE);
void main()
{
int i;
PNODE pHead = NULL;
int data;
ElemType et;
InitList(&pHead);
for(i = 0; i<15; i++)
{
AppendList(pHead, i);
}
data = IndexOf(pHead, 3);
printf("the position data is: %d\n", data);
TraverseList(pHead);
getch();
}
/* init list */
void InitList(PNODE * p)
{
*p = (PNODE)malloc(sizeof(NODE));
if(*p == NULL)
{
printf("overflow");
exit(0);
