树与二叉树的转换实现15.docxVIP

河南工程学院《数据结构与算法》课程设计成果报告 树与二叉树的转换实现 2014年12月29日 2. 5测试程序说明 (1)设置主函数调用相关函数用于实现树与二叉树的转换： int main ()( TreeNode *treeRoot; CreateTree(treeRoot); BTreeNode *binaryRoot 二 TreeToBinaryTree(treeRoot); MiddleOrderPrint(binaryRoot);printf (〃\n〃); return 0; （2）设置辅助函数供主程序调用，方便实现算法: void CreateTree(TreeNode* root)TreeNode *e = new TreeNode *f = new TreeNode *b = new b-child[0] TreeNode *e = new TreeNode *f = new TreeNode *b = new b-child[0]= e; b-child[1] = f; TreeNode *g = new TreeNode *d = new d-child[0]= g; TreeNode *c = new TreeNode *e = new TreeNode *f = new TreeNode *b = new b-child[0]= e; b-child[1] = f; TreeNode *g = new TreeNode *d = new d-child[0]= g;TreeNode *c TreeNode *e = new TreeNode *f = new TreeNode *b = new b-child[0]= e; b-child[1] = f; TreeNode *g = new TreeNode *d = new d-child[0]= g; TreeNode *c = new TreeNode ( E, TreeNode ( F, TreeNode ( B, TreeNode ( G, TreeNode ( D, TreeNode ( C , 0); 0); 2); 0); 1)； 0); root = new TreeNode ( A , 3); root-child[0] = b; root-child[l] = c; root-child[2]= d; 3程序清单 ^include stdio. h〃^include iostream ftinclude string〃树的节点 struct TreeNode { char element; int childNumbers;〃孩子结点的个数 struct TreeNode* child[3];〃孩子的数组 TreeNode () {} TreeNode(char ele, int numbers) (element = ele; childNumbers = numbers; for (int i=0; i3; i++)child[i]= NULL; ) TreeNodefe operator = (const TreeNode other) ( if (this == other) return *this; else ( element = other, element; childNumbers = other. childNumbers; for (int i=0; i3; i++)child[i] = other, child[i]; ) )}； 〃二叉树的结点typedef struct BTreeNode ( char element; BTreeNode BTreeNode bright; BTreeNodeBTreeNode(char ele = 0, BTreeNode *lchild = NULL, *rchi Id=NULL) BTreeNode {element = ele; left = Ichild;right = rchild; }BTreeNode;〃构建树 void CreateTree(TreeNode* root)TreeNode *e = TreeNode *f = TreeNode *b = b-child[0]= b-child[l]= TreeNode *g = TreeNode *d = TreeNode *e = TreeNode *f = TreeNode *b = b-child[0]= b-child[l]= TreeNode *g = TreeNode *d = TreeNode *e = TreeNode *f = TreeNode *b = b-child[0]