實(shí)驗(yàn)報(bào)告(二叉樹(shù))

數(shù)據(jù)結(jié)構(gòu)實(shí)驗(yàn)報(bào)告實(shí)驗(yàn)名稱：二叉樹(shù)學(xué)院：通信與信息工程學(xué)院班級(jí)：通工1414班姓名：陳婧瑤學(xué)號(hào)：05141133班內(nèi)序號(hào)：14任課教師：陳琳老師實(shí)驗(yàn)日期：2015.11成績(jī)：一.運(yùn)行程序#include<stdio.h>#include<stdlib.h>#include<malloc.h>#defineElemTypechar//節(jié)點(diǎn)聲明，數(shù)據(jù)域、左孩子指針、右孩子指針typedefstructBiTNode{ElemTypedata;structBiTNode*lchild,*rchild;}BiTNode,*BiTree;//先序建立二叉樹(shù)BiTreeCreateBiTree(){charch;BiTreeT;scanf("%c",&ch);if(ch=='#')T=NULL;else{T=(BiTree)malloc(sizeof(BiTNode));T->data=ch;T->lchild=CreateBiTree();T->rchild=CreateBiTree();}returnT;//返回根節(jié)點(diǎn)}//先序遍歷二叉樹(shù)voidPreOrderTraverse(BiTreeT){if(T){printf("%c",T->data);PreOrderTraverse(T->lchild);PreOrderTraverse(T->rchild);}}//中序遍歷voidInOrderTraverse(BiTreeT){if(T){InOrderTraverse(T->lchild);printf("%c",T->data);InOrderTraverse(T->rchild);}}//后序遍歷voidPostOrderTraverse(BiTreeT){if(T){PostOrderTraverse(T->lchild);PostOrderTraverse(T->rchild);printf("%c",T->data);}}voidPreOrderleaf(BiTreeT)/*先序遍歷輸出二叉樹(shù)中葉結(jié)點(diǎn),T為二叉樹(shù)根結(jié)點(diǎn)的指針*/{if(T!=NULL){if(T->lchild==NULL&&T->rchild==NULL)printf("%c",T->data);/*輸出葉結(jié)點(diǎn)*/ PreOrderleaf(T->lchild);/*先序遍歷左子樹(shù)*/ PreOrderleaf(T->rchild);/*先序遍歷右子樹(shù)*/}}intDepth(BiTreeT){//返回二叉樹(shù)的深度 intdepthLeft=0; intdepthRight=0; intdepthval=0; if(T==NULL)depthval=0;else{depthLeft=Depth(T->lchild);depthRight=Depth(T->rchild);depthval=1+(depthLeft>depthRight?depthLeft:depthRight);}returndepthval;}voidmain(){BiTreeT;intdepthval=0;T=CreateBiTree();//建立PostOrderTraverse(T);//輸出 printf("\n");PreOrderleaf(T);//輸出葉子節(jié)點(diǎn)