数据结构树的实验.docx

实验题目：树的基本操作（孩子兄弟法建立树并实现前序遍历操作）数据类型1.二叉链表的类型定义typedefstructCSNode{ElemTypedata ;structCSNode *firstchild, *nextsibling;}CSNode,*CSTree;typedefCSTreeQElemType;2.结点的类型定义typedefstructQNode{QElemType data;structQNode *next;}QNode,*QueuePtr; 3.两个指针域的类型定义typedefstruct{QueuePtr front;QueuePtr rear;}LinkQueue;算法设计1.层次遍历建立一棵树（孩子兄弟二叉链表）CSTreeCreateTree(){CSTreeT,p,r;intfa,ch;LinkQueue Q;int n;if(n==0) T=NULL;else {InitQueue(Q); T=(CSTree)malloc(sizeof(CSNode)); T-firstchild=T-nextsibling=NULL;EnQueue (Q,T);for(;n1;n--){CSTree s=(CSTree)malloc(sizeof(CSNode));s-data=ch;s-firstchild=s-nextsibling=NULL; p=GetHead(Q);while(p-data!=fa){DeQueue (Q);p=GetHead(Q);}if(!p-firstchild){p-firstchild=s; r=s;}else{r-nextsibling=s; r=s;}EnQueue (Q,s);}}DestroyQueue(Q);return T;}2.树的先序遍历即孩子兄弟链表线序遍历voidPreOrderTraverse(CSTree T){if(T){printf(%d ,T-data);PreOrderTraverse(T-firstchild);PreOrderTraverse(T-nextsibling);}}程序源代码#includestdio.h#includestring.h#includemalloc.h#includestdlib.h typedefint Status;typedefintElemType;typedefstructCSNode{ElemTypedata ;structCSNode *firstchild, *nextsibling;}CSNode,*CSTree;typedefCSTreeQElemType;typedefstructQNode{QElemType data;structQNode *next;}QNode,*QueuePtr; typedefstruct{QueuePtr front;QueuePtr rear;}LinkQueue;Status InitQueue(LinkQueue *Q){Q-front=Q-rear=(QueuePtr)malloc(sizeof(QNode));//指向头结点if(!Q-front) exit(0);Q-front-next=NULL;return 1;}Status EnQueue (LinkQueue *Q,QElemType e){QueuePtr p; p=(QueuePtr)malloc(sizeof(QNode));p-data=e;p-next=NULL; Q-rear-next=p; Q-rear=p;return 1;}Status DeQueue (LinkQueue *Q){ QueuePtr p;if(Q-front==Q-rear) return 0; p=Q-front-next; Q-front-next=p-next;if(Q-rear==p) Q-rear=Q-front;free(p);return 1;}QElemTypeGetHead(LinkQueue *Q){if(Q-front==Q-rear) return 0;return Q-front-next-data;}Status DestroyQueue(LinkQueue *Q){while(Q-front){Q-rear=Q-front-next;free(Q-front); Q-front=Q-rear;}return 1;}//层次遍历建立一棵树（孩子兄弟二叉链表）CSTreeCreateTree(){CSTree