数据结构实训报告

1、树与二叉树转化的实考核项考核内得树与二叉树转化的实考核项考核内得（20）（20）（15分）回答老师针对课程设问课程设撰（10）（5）总 指导教师评语日期目录1课程设计目标与任1.1 课程设计目1.2课程设计任目录1课程设计目标与任1.1 课程设计目1.2课程设计任2分析与设题目算法分结构设算法描程序流程算法实现说3程. 4测4.1测试数分5总参考文1程设计目标与任1.1程设计目设计的综合训练,1程设计目标与任1.1程设计目设计的综合训练,1.2程设计任2析与设2.1目算法分。n（1）；（2）；（3）连结所有兄弟结点（拥有同一个父结点的子结点。（1）（2）的；（3）结构设2析与设2.1目算法分。

2、n（1）；（2）；（3）连结所有兄弟结点（拥有同一个父结点的子结点。（1）（2）的；（3）结构设分析树和二叉树结构，二叉树2.12.12.22.22.3法描2.4序流程2.22.22.3法描2.4序流程2.32.32.5法实现说（1）voidpreorderTree(CTreeNode*ctroot)/dataCTreeNode coutctroot-2.32.5法实现说（1）voidpreorderTree(CTreeNode*ctroot)/dataCTreeNode coutctroot-for(i=0;iCTreeFront=q-void initQueueBTree(QueueBTr

3、ee （2）BTreeNode *BTreeArrayMAX_NODE_NUMtypedef struct 址/struct nodeBTree void initQueueCTree(QueueCTree q=(QueueCTree q-CTreeFront=q-void initQueueBTree(QueueBTree q=(QueueBTree q-BTreeFront=q-addQueueCTree(QueueCTree *&q,CTreeNode if(q-CTreeRear+1)%MAX_NODE_NUM=q-CTreeFront)/return q-CTreeRear=(q-q

4、-CTreeArrayq-return 1;/addQueueBTree(QueueBTree *&q,BTreeNode if(q-BTreeRear+1)%MAX_NODE_NUM=q-BTreeFront)/return q-BTreeRear=(q-q-BTreeArrayq-return 1;/（3）btroot的，从根开始一直向右，遇到的点的return q-CTreeRear=(q-q-CTreeArrayq-return 1;/addQueueBTree(QueueBTree *&q,BTreeNode if(q-BTreeRear+1)%MAX_NODE_NUM=q-BTre

5、eFront)/return q-BTreeRear=(q-q-BTreeArrayq-return 1;/（3）btroot的，从根开始一直向右，遇到的点的中变为该结点右侧的兄弟），将树转化成二叉树voidTreeToBTree(CTreeNode*ctroot,BTreeNode*&btroot)/ctroot，btroot,QueueCTree QueueBTree *VisitedBTreeNodes;/initQueueBTree(VisitedBTreeNodes);/CTreeNode BTreeNode btroot=(BTreeNode *)malloc(sizeof(BTr

6、eeNode);/btroot-troot-data;/btroot-lchild=btroot-addQueueCTree(VisitedCTreeNodes,ctroot);/addQueueBTree(VisitedBTreeNodes,btroot);/ctnode=delQueueCTree(VisitedCTreeNodes);/btnode=delQueueBTree(VisitedBTreeNodes);/if(ctnode-childreni=NULL)/p=(BTreeNode *)malloc(sizeof(BTreeNode);/点p-tnode-childreni-p

7、-lchild=p-BTreeNode btroot=(BTreeNode *)malloc(sizeof(BTreeNode);/btroot-troot-data;/btroot-lchild=btroot-addQueueCTree(VisitedCTreeNodes,ctroot);/addQueueBTree(VisitedBTreeNodes,btroot);/ctnode=delQueueCTree(VisitedCTreeNodes);/btnode=delQueueBTree(VisitedBTreeNodes);/if(ctnode-childreni=NULL)/p=(B

8、TreeNode *)malloc(sizeof(BTreeNode);/点p-tnode-childreni-p-lchild=p-btnode-lchild=p;/LastSibling-rchild=p;/addQueueCTree(VisitedCTreeNodes,ctnode-addQueueBTree(VisitedBTreeNodes,p);/void Preorder(BTreeNode coutT-Preorder(T-void Preorder(BTreeNode coutT-Preorder(T-Preorder(T-3using #defineDEGREE3using

9、 #defineDEGREE5 #define NULL 0#define QUEUESIZE #define MAX_NODE_NUM typedef struct st1/char data;/charstruct st1 *childrenDEGREE;/typedefstructst2char data;/struct st2 *lchild,*rchild;/CTreeNode *SearchCTree(CTreeNode *root ,char CTreeNode*returnNode; return root;CTreeNode char data, CTreeNode*root

10、,*parentNode,*node; returnNULL;/空树，结束函数 root=(CTreeNode*)malloc(sizeof(CTreeNode); node=(CTreeNode*)malloc(sizeof(CTreeNode); if(parentNode-return void preorderTree(CTreeNode *ctroot)/return void preorderTree(CTreeNode *ctroot)/dataCTreeNode*ctchild; coutdataCTreeFront=q-QueueBTreeEmpty(QueueBTree r

11、eturn(q-BTreeFront=q-CTreeNode *delQueueCTree(QueueCTree CTreeNode return NULL;/返回空指针return ctroot;/return 0;return 1;/QueueCTreeEmpty(QueueCTree return(q-CTreeFront=q-QueueBTreeEmpty(QueueBTree return(q-BTreeFront=q-CTreeNode *delQueueCTree(QueueCTree CTreeNode return NULL;/返回空指针return ctroot;/BTre

12、eNode *delQueueBTree(QueueBTree BTreeNode return NULL;/返回空指针return btroot;/void TreeToBTree(CTreeNode *ctroot,BTreeNode *&btroot)/ctrootbtroot,QueueCTree *VisitedCTreeNodes; QueueBTree*VisitedBTreeNodes;/辅助队列 CTreeNode *ctnode;BTreeNode*btnode,*p,*LastSibling; btroot=(BTreeNode *)malloc(sizeof(BTreeNode);/btroot-troot-data;/p=(BTreeNode *)malloc(sizeof(BTreeNode);/p-tnode-childreni-p-t