2.25数据结构作业

�index.php/tags-41973.html" >�

//1seqn[tail] = data;tail = (tail+1)%SEQLEN;//2data = seqn[head];head = (head+1)%SEQLEN;//3head = tail;//4(tail+1)%SEQLEN == head;//5while(head != tail){    tail--;}//6(tail-head+SEQLEN)%SEQLEN;//7SEQLEN-1

//1new->next = next;prev->next = new;//2struct list_head* new = prev->next;prev->next = new->next;free(new);  new=NULL;//3struct list_head* p=head;while(p->next != NULL){    p=p->next;}new->next = p->Next;p->next = new;//4struct list_head* p = head;while(p->next != entry && p->next != NULL){    p=p->next;}p->next = p->next->next;free(entry); entry=NULL;//5if(head->next == NULL){    printf("队列为空\n");    return 1;}else{    return 0;}