《数据结构》实验指导书 - 图文(3)

p=head->next;

if( head==NULL )

printf(\ else {

printf(\ while(p != NULL) {

printf(\ p=p->next; } }

printf(\}

node *insert_x_after_y(node *head,datatype x,datatype y) {

node *p,*add_y;

add_y = find_num_hlink_list(head,y); if( add_y == NULL ) {

printf(\，cann't insert the node %d\\n\ return head; }

p=(node*)malloc(sizeof(node)); p->info=x;

p->next=add_y->next; add_y->next=p; return head; }

node *delete_z(node *head,datatype z) {

node *p,*q; p=head;

if(p==NULL) {

printf(\ return 1; }

if(p->info==z) {

printf(\ head=p->next; free(p); return 0; }

while(p->info!=z&&p!=NULL) {

q=p;

p=p->next; }

if(z==p->info) {

if(p==head) {

printf(\

head=p->next; free(p); return 0; } else {

printf(\ q->next=p->next; free(p); return 0; } } else {

printf(\ return 1; } }