线性表-链式结构-查找-插入-删除

源程序：

#include \"stdio.h\" #include \"stdlib.h\" #define MAX 32767

typedef struct Node {

int data; /*数据域*/ struct Node *next; /*指针域*/ }LinkList;

void InitLinkList(LinkList *L); void CreatLinkList(LinkList *L); void OutLinkList(LinkList *L); int SearchLinkList(LinkList *L); void InsertNode(LinkList *L); void DeleNode(LinkList *L); int Fvalue; void main() {

int k;

LinkList L;

InitLinkList(&L); CreatLinkList(&L);

OutLinkList(&L);

k=SearchLinkList(&L);

if(k==1) printf(\"The Fvalue=%d is exist!\\n\ else printf(\"The Fvalue=%d is not exist!\\n\ InsertNode(&L); OutLinkList(&L); DeleNode(&L); OutLinkList(&L); }

void InitLinkList(LinkList *L) {

L=(LinkList *)malloc(sizeof(Node));

L->next=NULL; }

void CreatLinkList(LinkList *L) /*采用带头结点的尾结点插入法创建单链表*/ {

int key;

LinkList *p,*q; q=L;

printf(\"Please input the node's value and end 32767:\");

scanf(\"%d\ while(keyp=(LinkList *)malloc(sizeof(Node));

p->data=key; p->next=NULL; q->next=p; q=p; }

scanf(\"%d\}

void OutLinkList(LinkList *L) {

LinkList *p; p=L->next;

while(p!=NULL) { printf(\"%d->\ }

p=p->next;

printf(\"NULL\\n\"); }

int SearchLinkList(LinkList *L) /*按值查找*/ {

LinkList *p;

p=L->next;

printf(\"Please input the value of your search:\"); scanf(\"%d\while(p!=NULL) {

if(p->data!=Fvalue) p=p->next; else break;

}

if(p==NULL) return 0;

else return 1;

}

void InsertNode(LinkList *L) /*在结点之后插入*/ {

int value,locate,i=0;

LinkList *p,*q,*s; p=L;

q=L->next;

}

printf(\"Please input the value and locate of insert:\");

scanf(\"%d%d\ /*locate=0表示在头结点之后插入*/ printf(\"value=%d,after locate=%d\\n\ while(i!=locate) { }

p=p->next; q=q->next; i++;

s=(LinkList *)malloc(sizeof(Node));

s->data=value; p->next=s; s->next=q;

void DeleNode(LinkList *L) {

int locate,i=0; LinkList *p,*q; p=L;

printf(\"Please input the delet number's Location:\"); scanf(\"%d\

while(i!=locate) {

q=p; p=p->next; }

i++; }

q->next=p->next; free(p);