单向链表、双向链表.doc

是单向链表、双向链表，栈，队列的C语言的实现方法，只包含简单的插入删除操作 1，单向链表的插入，删除，逆序操作 #include stdio.h#include stdlib.h typedef struct Node{?int key;?struct Node* next;}* node; node newNode(int k){?node n=(node)malloc(sizeof(node));?n-key=k;?n-next=NULL;?return n;} void printlist(node n){?if(!n)?{?? printf(n is NULL list\n);?}??? while(n)?{? printf(%d,n-key);? printf( );? n=n-next;?}?printf(\n);} node newList(){?int k;?node head=(node)malloc(sizeof(node));;?scanf(%d,k);?if(k==0)?{? head=NULL;? return head;?}?else?{? node n=newNode(k);? head=n;? while(k)? {?? scanf(%d,k);?? if(k!=0)?? {??? node n1=newNode(k);??? n-next=n1;??? n=n-next;?? }? }? n-next=NULL;? return head;?}} node insertNode(node n,int p,int k){?? ?node n1=newNode(k);?node head=(node)malloc(sizeof(node));?head=n;??? if(head==NULL)?{?n1-next=head;?return n1;?}?else?{? if(p==1)? {?? n1-next=head;?? head=n1;?? return head;? }? else? {???????? ?? int i=2;?? while(i!=p(n-next))?? {??? n=n-next;??? i++;?? }?? if(n-next==NULL)?? {??? printf(the p cant be found\n);??? return head;?? }?? else?? {??? n1-next=n-next;??? n-next=n1;??? return head;?? }? }?}} node deleteNode(node n,int k){?? ?node n1=(node)malloc(sizeof(node));??? node head=(node)malloc(sizeof(node));?head=n;?if(head==NULL)?{? printf(list is NULL\n);? return head;?}?else?{? if(head-key==k)? {?? head=head-next;?? return head;? }? while(n-key!=kn-next)? {?? n1=n;?? n=n-next;? }???? if(n==NULL)? {?? printf(cant find the same value as k in this list\n);?? return head;? }? else? {?? n1-next=n-next;?? n=NULL;?? return head;? }?}} node reverse(node n){ ?node n1[10];?node head=(node)malloc(sizeof(node));??? node n2=(node)malloc(sizeof(node));?head=n; ?if(head==NULL) ?{ ? return head;?}?else?{? int i=0;? while(head!=NULL)? {? n2=head;? head=head-next;? n2-next=NULL;? n1[i]=n2;? i++;? } ? head=n1[i-1];? for(int j=i-1;j0;j--)? {? n1[j]-next=n1[j