二叉樹相關(guān)算法

1、學(xué)生實驗報告學(xué)生姓名學(xué)號同組人實驗項目二叉樹算法的實現(xiàn)P必修選修演示性實驗驗證性實驗P操作性實驗 綜合性實驗實驗地點H110實驗儀器臺號指導(dǎo)教師鄧慶山實驗日期及節(jié)次2010-10-13 1、 2 節(jié)2010-10-20 1、 2 節(jié)2010-10-27 1、 2 節(jié)一、實驗綜述1、實驗?zāi)康募耙?實現(xiàn)二叉樹的創(chuàng)建、三種遍歷、求深度、葉子結(jié)點數(shù)、結(jié)點數(shù)、銷毀二叉樹等 相關(guān)算法。2、實驗儀器、設(shè)備或軟件設(shè)備：計算機軟件：Windows xp + Visual studio 6.0二、實驗過程(實驗步驟、記錄、數(shù)據(jù)、分析)#includeusing namespace std;#define MAX

2、_TREE_SIZE 100typedef struct BiTNodechar data;struct BiTNode *lchild; struct BiTNode *rchild;*BiTree;void CreatBT(BiTree &T)char ch;cinch; if(ch=#) T=NULL;elseT=(BiTNode *)malloc(sizeof(BiTNode);if(!T) exit(0);T-data = ch;CreatBT(T-lchild);CreatBT(T-rchild);void pre_order(BiTNode *T)if(T) coutdata;

3、pre_order(T-lchild); pre_order(T-rchild);void mid_order(BiTNode *T)if(T) pre_order(T-lchild); coutdata; pre_order(T-rchild);void behind_order(BiTNode *T)if(T)behind_order(T-lchild);behind_order(T-rchild); coutdata;int PostTreeDepth(BiTNode *T)int n1,n2; if(T!=NULL)n1=PostTreeDepth(T-lchil d);n2=Post

4、TreeDepth(T-rchild);return (n1n2)?n1:n2)+1; return 0;int num(BiTNode *T)int n=0; if(!T) return 0; if(T-data!=NULL)n+; return n+num(T-lchild)+num(T-rchild);int Leaf_num(BiTNode *T)if(!T) return 0;if(T-lchild=NULL&T-rc hild=NULL)return(1);return Leaf_num(T-lchild)+Leaf_num(T-rchild);void DestroyBiTree

5、(BiTNode *T)if(T)DestroyBiTree(T-lchild);DestroyBiTree(T-rchild);free(T);T=NULL;int main()BiTNode *T;cou t輸入一串字符endl;CreatBT(T);cout先序遍歷：endl;pre_order(T);coutendl;cout中序遍歷：endl;mid_order(T);coutendl;cout后序遍歷：endl; behind_order(T); coutendl;cou t二叉樹樹深 為:endl;coutPostTreeDepth(T);coutendl;cou t二叉樹結(jié)點數(shù) 為 :endl;coutnum(T); coutendl;cou t二叉樹葉子