数据结构实训报告

1、树与二叉树的转考核项考核内得（20）（20树与二叉树的转考核项考核内得（20）（20）（15分）回答老师针对课程设问课程设撰（10）（5）总 指导日期目录1课程设计目标与任课程设计目课程设计目课程设计要目录1课程设计目标与任课程设计目课程设计目课程设计要2分析与设题目需求分结构设算法分程序流程3程4测分5总参考文11.11.2（1）（3）（4）1.3（1）11.11.2（1）（3）（4）1.3（1）（2）22.1继。它可采用顺结构和链1.2.2.22.：22.1继。它可采用顺结构和链1.2.2.22.：3.（1）3.（1）4.（1） 加线：若pp孩子沿分支找到的所有右孩子，都与p（2）（3）2

2、.2.62.3typedef struct st1/char data;/charstruct st1 *childrenDEGREE;/typedef struct char data;/2.3typedef struct st1/char data;/charstruct st1 *childrenDEGREE;/typedef struct char data;/struct st2 *lchild,*rchild;/2.3.12.typedef struct CTreeNode*CTreeArrayMAX_NODE_NUM;/struct nodeCTree 3.typedef str

3、uct BTreeNode*BTreeArrayMAX_NODE_NUM;/struct nodeBTree 4.addQueueCTree(QueueCTree *&q,CTreeNode if(q-CTreeRear+1)%MAX_NODE_NUM=q-CTreeFront)/typedef struct CTreeNode*CTreeArrayMAX_NODE_NUM;/struct nodeCTree 3.typedef struct BTreeNode*BTreeArrayMAX_NODE_NUM;/struct nodeBTree 4.addQueueCTree(QueueCTre

4、e *&q,CTreeNode if(q-CTreeRear+1)%MAX_NODE_NUM=q-CTreeFront)/return q-CTreeRear=(q-q-CTreeArrayq-return 1;/5.addQueueBTree(QueueBTree *&q,BTreeNode if(q-BTreeRear+1)%MAX_NODE_NUM=q-BTreeFront)/return q-BTreeRear=(q-q-BTreeArrayq-return 1;/6.CTreeNode *delQueueCTree(QueueCTree CTreeNode if(q-CTreeFro

5、nt=q-CTreeRear)/return NULL;/q-CTreeFront=(q-ctroot=q-CTreeArrayq-if(q-BTreeRear+1)%MAX_NODE_NUM=q-BTreeFront)/return q-BTreeRear=(q-q-BTreeArrayq-return 1;/6.CTreeNode *delQueueCTree(QueueCTree CTreeNode if(q-CTreeFront=q-CTreeRear)/return NULL;/q-CTreeFront=(q-ctroot=q-CTreeArrayq-return ctroot;/7

6、.BTreeNode *delQueueBTree(QueueBTree BTreeNode if(q-BTreeFront=q-BTreeRear)/return NULL;/q-BTreeFront=(q-btroot=q-BTreeArrayq-return btroot;/2.42.43using #defineDEGREE53using #defineDEGREE5 #define NULL 0#define QUEUESIZE#defineMAX_NODE_NUMtypedefstructst1/树结点的类chardata;/数据域，采用charstructst1*children

7、DEGREEtypedefstructst2chardatastructst2*lchild,*rchild;/CTreeNode*SearchCTree(CTreeNode*root ,charCTreeNode*returnNode; returnreturn NULL;returnCTreeNodechardata, CTreeNode*root,*parentNode,*node; returnchardata, CTreeNode*root,*parentNode,*node; returnNULL;/空树，结束函数 root=(CTreeNode*)malloc(sizeof(CT

8、reeNode); node=(CTreeNode*)malloc(sizeof(CTreeNode); returnvoidpreorderTree(CTreeNode*ctroot)/遍历每个节点的操作就是输出该结点的dataCTreeNode*ctchild; coutdata ;/先遍历根结点 coutdata ;/先遍历根结点 typedefstructnodeCTree /structnodeCTree*next; typedefstructnodeBTree /structnodeBTreevoidinitQueueCTree(QueueCTreeq=(QueueCTree*)m

9、alloc(sizeof(QueueCTree); voidinitQueueBTree(QueueBTreeq=(QueueBTree*)malloc(sizeof(QueueBTree); addQueueCTree(QueueCTree*&q,CTreeNodereturn 0;returnaddQueueCTree(QueueCTree*&q,CTreeNodereturn 0;return1;/入队addQueueBTree(QueueBTree*&q,BTreeNodereturn 0;return1;/入队QueueCTreeEmpty(QueueCTree*q)QueueBTr

10、eeEmpty(QueueBTree*q)CTreeNode*delQueueCTree(QueueCTreeCTreeNodereturn NULL;/返回空指针returnctroot;/返回结BTreeNode*delQueueBTree(QueueBTreeBTreeNodereturn NULL;/返回空指针returnbtroot;/返回BTreeNode*delQueueBTree(QueueBTreeBTreeNodereturn NULL;/返回空指针returnbtroot;/返回节voidTreeToBTree(CTreeNode*ctroot,BTreeNode*&btroot)/树转化为二叉树ctroot指向树的根结点， QueueCTree *VisitedCTreeNodes; QueueBTree*VisitedBTreeNodes;/辅助队列 CTreeNode *ctnode;BTreeNode*btnode,*p,*LastSibling; 完 voidPreorder(BTreeNode coutdata ; CTreeNode *Tree; BTreeNode *BTree; return47，树根结点的数据a，ba,ca,da,eb,fc,gc，4.1.147，树根结点