ʱ : 数据结构习题及答案——严蔚敏 - 百度文库ϿʼĶ
typedef struct node {
elemtype data; struct node *link; }NODE;
void analyze(NODE *a {
NODE *rh*qh*r,*q,*p
int i=0j=0/*iΪĽ jΪżĽ */ p=a
rh=NODE *mallocsizeofNODE/*rhΪͷָ */
qh=(NODE *)malloc(sizeof(NODE)); /*qhΪżͷָ */ r=rh; q=qh;
while(p!=NULL) {
r->link=p; r=p; i++; p=p->link;
wordĵ ɸƱ༭
if(p!=NULL) {
q->link=p; q=p; j++; p=p->link; } }
rh->data=i; r->link=rh; qh->data=j; q->link=qh; } 11.
typedef struct node {
elemtype data; struct node *link; }NODE;
void change(NODE *head) {
NODE *p; p=head;
wordĵ ɸƱ༭
if(head!=NULL) {
while(p->link!=NULL) p=p->link; p->link=head; } } 12.
typedef struct node {
elemtype data; struct node *link; }NODE;
void del(NODE *x,NODE *y) {
NODE *p,*q; elemtype d1; p=y; q=x;
while(q->next!=NULL) /* ѺһǰƵǰһ*/ {
p->data=q->data;
wordĵ ɸƱ༭
q=q->link; p=q;
p->link=NULL; /* ɾһ*/ free(q); }
ջͶ һѡ
1. һջջa,b,c,d,e,ջIJܵǣ
A edcbaBdecbaCdceab Dabcde 2.ջṹͨõִ洢ṹǣ
A Դ洢ṹ洢ṹBɢзʽʽ C洢ṹ DԴ洢ṹͷԴ洢ṹ 3.жһջST(ԪΪm0)Ϊյǣ A ST-top!=0 BST-top==0 CST-top!=m0 DST-top=m0
4.жһջST(ԪΪm0)Ϊջǣ AST->top!=0 BST->top==0 CST->top!=m0-1DST->top==m0-1
5.һе1,2,3,4,еǣ A4,3,2,1B1,2,3,4C1,4,3,2D3,2,4,1
wordĵ ɸƱ༭