数据结构所有实验综打印版复习版.doc

// 链表。 #include iostream #include string.h using namespace std; struct node { int num; node *next; }; node *creat()//链表建立 { int n=0; node *p1,*p2,*head; p1=p2=new node; cinp1-num; head=NULL; while(p1-num!=0) { if(n==0) { head=new node; head-next=p1; } else p2-next=p1; p2=p1; p1=new node; cinp1-num; n++; } p2-next=NULL; return head; } int listlength(node *l)//计算长度 { node *p=l-next; int count=0; while (p) { count++; p=p-next; } return count; } int search(node *l,int value)//链表的查找 { node *p=l; int index=0; while(p) { if(p-num==value) return index; p=p-next; index++; } return 0; } void print(node *head){//打印链表 node* p=head-next; while(p){ coutp-num ; p=p-next; } coutendl; } void destruct(node *head){//清空链表 node *current=head,*temp=NULL; while(current) { temp=current; current=current-next; delete temp; } couthad been destructed.endl; } void reverselist(node* l)//链表逆序 { node *p,*q,*r; p=l-next-next;q=p-next; if(p==NULL) return; r=l-next; r-next =NULL; while(p-next!=NULL){ //每次将未逆置的链表中的首结点*p，挂在部分逆置好的链表首结点*r之前， //在改变p-next之前，将p的后继结点存储在q之中 p-next=r; r=p; p=q;q=p-next; } p-next=r; //最后一结点的处理 l-next=p; } node *Merge(node *head1 , node *head2) { //合并两个有序链表 node *head; if ( head1 == NULL) return head2 ; if ( head2 == NULL) return head1 ; if ( head1-num =head2-num ) { head = head1 ; head1= head1-next; } else { head = head2 ; head2 = head2-next ; } node *temp = head ; while ( head1 != NULL head2 != NULL) { if ( head1-num = head2-num ) { temp-next = head1 ; head1 = head1-next ; temp =temp-next; } else { temp-next = head2; head2 = head2-next ; temp =temp-next; } } if (head1 == NULL) temp-next = head2; if (head2 == NULL) temp-next = head1; return head-next; } node* Delete(node* head , int num