數(shù)據(jù)結(jié)構(gòu)實(shí)驗(yàn)三：二叉樹的應(yīng)用

1、數(shù)據(jù)結(jié)構(gòu)實(shí)驗(yàn)報(bào)告實(shí)驗(yàn)題目： 第三次實(shí)驗(yàn)二叉樹的應(yīng)用 姓名： 劉創(chuàng) 學(xué)號： 132054137 班級： 1320541 系名： 計(jì)算機(jī)工程系 專業(yè)： 計(jì)算機(jī)科學(xué)與技術(shù) 指導(dǎo)老師： 劉海靜 實(shí)驗(yàn)時(shí)間：2015年5月28日星期四 實(shí)驗(yàn)地點(diǎn)： 軟件實(shí)驗(yàn)室 【實(shí)驗(yàn)概述】1.實(shí)驗(yàn)?zāi)康募耙竽康模赫莆斩鏄涞挠嘘P(guān)知識，存儲太原工業(yè)學(xué)院機(jī)構(gòu)圖要求：存儲二叉樹； 遍歷二叉樹 計(jì)算二叉樹的葉子，結(jié)點(diǎn)數(shù)數(shù)等2.實(shí)驗(yàn)原理二叉樹應(yīng)用原理3.實(shí)驗(yàn)環(huán)境（使用的軟件）VC+6.0/VS2013【實(shí)驗(yàn)內(nèi)容】1. 實(shí)驗(yàn)算法設(shè)計(jì)實(shí)驗(yàn)：使用二叉樹存儲太原工業(yè)學(xué)院機(jī)構(gòu)； 2. 實(shí)驗(yàn)過程（源代碼及描述、調(diào)試過程及分析）調(diào)試過程中，兩個(gè)實(shí)

2、驗(yàn)沒有出現(xiàn)太大的問題，理論聯(lián)系實(shí)際，多時(shí)間去實(shí)踐方可等心應(yīng)手。實(shí)驗(yàn)代碼: BinaryTree.cpp#include#include#includeusing namespace std;typedef char ElemType; /數(shù)據(jù)類型typedef struct TREEstruct TREE *lTree; /左子樹struct TREE *rTree; /右子樹 char data40; /數(shù)據(jù)聲明為字符數(shù)組Tree;void InitBinaryTree(Tree *tree); /初始化二叉樹void CreateBinaryTree(Tree *tree); /創(chuàng)建二叉樹

3、void PreTraverse(Tree *tree); /先序遍歷二叉樹int DepthTree(Tree *tree); /二叉樹深度函數(shù)int LeafsTree(Tree *tree); /葉子個(gè)數(shù)函數(shù)void InitBinaryTree(Tree *tree) /初始化二叉樹tree-lTree = NULL;/初始化數(shù)據(jù)tree-rTree = NULL;strcpy_s(tree-data, 0);void CreateBinaryTree(Tree *tree)/創(chuàng)建樹int n = 0, m = 0, i = 0;cout ;char Data20;cin Data;s

4、trcpy_s(tree-data, Data);cout data n;if (n = 1)Tree *lTree = (Tree*)malloc(sizeof(Tree);tree-lTree = lTree;lTree-lTree = NULL;lTree-rTree = NULL;CreateBinaryTree(tree-lTree);cout data i;if (i = 0);else if (i = 1)Tree *rTree = (Tree*)malloc(sizeof(Tree);tree-rTree = rTree;rTree-lTree = NULL;rTree-rTr

5、ee = NULL;CreateBinaryTree(tree-rTree);else if (n = 0)cout data m;if (m = 0);else if (m = 1)Tree *rTree = (Tree*)malloc(sizeof(Tree);tree-rTree = rTree;rTree-lTree = NULL;rTree-rTree = NULL;CreateBinaryTree(tree-rTree);void PreTraverse(Tree *tree) /先序遍歷二叉樹if (tree != NULL)cout data lTree != NULL)Pre

6、Traverse(tree-lTree);cout rTree);else if (tree-rTree != NULL)PreTraverse(tree-rTree);void InTraverse(Tree *tree)/中序遍歷遞歸if (tree != NULL)if (tree-lTree != NULL)InTraverse(tree-lTree);cout data rTree);cout rTree != NULL)cout data rTree);elsecout data lTree != NULL)PostTraverse(tree-lTree);PostTraverse

7、(tree-rTree);cout data rTree != NULL)PostTraverse(tree-rTree);cout data ;elsecout data lTree=NULL&tree-rTree=NULL) return 1;/葉子結(jié)點(diǎn)l = DepthTree(tree-lTree);r = DepthTree(tree-rTree);return (l = r ? l + 1 : r + 1);int LeafTree(Tree *tree)/葉子個(gè)數(shù)函數(shù)if (tree = NULL)return 0;else if (tree-lTree = NULL&tree-

8、rTree = NULL)return 1;return(LeafTree(tree-lTree) + LeafTree(tree-rTree);int main(int argc, char *argv)system(color 1b);Tree tree;InitBinaryTree(&tree); /初始化二叉樹cout 后輸入機(jī)構(gòu)的數(shù)據(jù)內(nèi)容n（請輸入機(jī)構(gòu)名稱，如：太原工業(yè)學(xué)院、計(jì)算機(jī)工程系、計(jì)科專業(yè)、班級等）;CreateBinaryTree(&tree); /創(chuàng)建二叉樹cout 先序遍歷的結(jié)果為：n; PreTraverse(&tree); /先序遍歷二叉樹cout 中序遍歷的結(jié)果為：n;InTraverse(&tree); /中序遍歷遞歸cout 后序遍歷的結(jié)果為：n;PostTraverse(&tree); /后序遍歷遞歸cout n此二叉樹深度為： DepthTree(&tree);cou