数据结构实验三：二叉树的应用

1、数据结构实验报告实验题目： 第三次实验二叉树的应用 姓名： 刘创 学号： 132054137 班级： 1320541 系名： 计算机工程系 专业： 计算机科学与技术 指导老师： 刘海静 实验时间：2015年5月28日星期四 实验地点： 软件实验室 【实验概述】1.实验目的及要求目的：掌握二叉树的有关知识，存储太原工业学院机构图要求：存储二叉树； 遍历二叉树 计算二叉树的叶子，结点数数等2.实验原理二叉树应用原理3.实验环境（使用的软件）VC+6.0/VS2013【实验内容】1. 实验算法设计实验：使用二叉树存储太原工业学院机构； 2. 实验过程（源代码及描述、调试过程及分析）调试过程中，两个实

2、验没有出现太大的问题，理论联系实际，多时间去实践方可等心应手。实验代码: BinaryTree.cpp#include<iostream>#include<string.h>#include<string>using namespace std;typedef char ElemType; /数据类型typedef struct TREEstruct TREE *lTree; /左子树struct TREE *rTree; /右子树 char data40; /数据声明为字符数组Tree;void InitBinaryTree(Tree *tree); /初

3、始化二叉树void CreateBinaryTree(Tree *tree); /创建二叉树void PreTraverse(Tree *tree); /先序遍历二叉树int DepthTree(Tree *tree); /二叉树深度函数int LeafsTree(Tree *tree); /叶子个数函数void InitBinaryTree(Tree *tree) /初始化二叉树tree->lTree = NULL;/初始化数据tree->rTree = NULL;strcpy_s(tree->data, "0");void CreateBinaryTr

4、ee(Tree *tree)/创建树int n = 0, m = 0, i = 0;cout << "n->"char Data20;cin >> Data;strcpy_s(tree->data, Data);cout <<"""<<tree->data << ""（机构）是否有左子树（下属机构）（0：没有 1：有）："cin >> n;if (n = 1)Tree *lTree = (Tree*)malloc(sizeof

5、(Tree);tree->lTree = lTree;lTree->lTree = NULL;lTree->rTree = NULL;CreateBinaryTree(tree->lTree);cout <<"""<<tree->data << ""（机构）是否有右子树（并列机构）（0：没有 1：有）："cin >> i;if (i = 0);else if (i = 1)Tree *rTree = (Tree*)malloc(sizeof(Tree);tr

6、ee->rTree = rTree;rTree->lTree = NULL;rTree->rTree = NULL;CreateBinaryTree(tree->rTree);else if (n = 0)cout << """ << tree->data << ""（机构）是否有右子树（并列机构）（0：没有 1：有）："cin >> m;if (m = 0);else if (m = 1)Tree *rTree = (Tree*)malloc(sizeof

7、(Tree);tree->rTree = rTree;rTree->lTree = NULL;rTree->rTree = NULL;CreateBinaryTree(tree->rTree);void PreTraverse(Tree *tree) /先序遍历二叉树if (tree != NULL)cout << tree->data << " "if (tree->lTree != NULL)PreTraverse(tree->lTree);cout << "ntt"Pre

8、Traverse(tree->rTree);else if (tree->rTree != NULL)PreTraverse(tree->rTree);void InTraverse(Tree *tree)/中序遍历递归if (tree != NULL)if (tree->lTree != NULL)InTraverse(tree->lTree);cout << tree->data << " "InTraverse(tree->rTree);cout << "nt"else

9、if (tree->rTree != NULL)cout << tree->data << " "InTraverse(tree->rTree);elsecout << tree->data << " "void PostTraverse(Tree *tree)/后序遍历递归if (tree != NULL)if (tree->lTree != NULL)PostTraverse(tree->lTree);PostTraverse(tree->rTree);cout

10、 << tree->data << " "else if (tree->rTree != NULL)PostTraverse(tree->rTree);cout << tree->data << " "elsecout << tree->data << " "int DepthTree(Tree *tree) /二叉树深度函数int l, r;if (tree = NULL) return 0; /节点本身为空if (tree->

11、;lTree=NULL&&tree->rTree=NULL) return 1;/叶子结点l = DepthTree(tree->lTree);r = DepthTree(tree->rTree);return (l >= r ? l + 1 : r + 1);int LeafTree(Tree *tree)/叶子个数函数if (tree = NULL)return 0;else if (tree->lTree = NULL&&tree->rTree = NULL)return 1;return(LeafTree(tree-&

12、gt;lTree) + LeafTree(tree->rTree);int main(int argc, char *argv)system("color 1b");Tree tree;InitBinaryTree(&tree); /初始化二叉树cout << "请客户在->后输入机构的数据内容n（请输入机构名称，如：太原工业学院、计算机工程系、计科专业、班级等）"CreateBinaryTree(&tree); /创建二叉树cout << "先序遍历的结果为：n" PreTraverse(&tree); /先序遍历二叉树cout << "中序遍历的结果为：n"InTraverse(&tree); /中序遍历递归cout << "后序遍历的结果为：n"PostTraverse(&tree); /后序遍历递归cout << "n此二叉树深度为：" << DepthTre