实验报告二叉树

数据结构实验报告实验名称二叉树学院通信与信息工程学院班级通工1414班姓名陈靖瑶学号05141133班内序号14任课教师陈琳老师实验日期

2015.11成绩一.运行程序#include stdio.h#includestdlib.h#includemalloc.h#define ElemTypechar〃节点声明，数据域、左孩子指针、右孩子指针typedef struct BiTNode{ElemType data;structBiTNode*lchild,*rchild;}BiTNode,*BiTree;〃先序建立二叉树BiTree CreateBiTree{char ch;BiTree T;scanfH%cn,ch;if ch=#T=NULL;else{T=BiTreemallocsizeofBiTNode;T-data=ch;T-lchild=CreateBiTree;T-rchild=CreateBiTree;}〃返回根节点return T;〃先序遍历二叉树void PreOrderTraverseBiTreeT{ifT{printfn%cn,T-data;PreOrderTraverseT-lchild;PreOrderTraverseT-rchild;}〃中序遍历void InOrderTraverseBiTreeT{ifT{InOrderTraverseT-lchild;printfH%cn,T-data;InOrdcrTravcrscT-rchild;〃后序遍历void PostOrderTraverseBiTreeT{ifT{PostOrderTraverseT-lchild;PostOrderTraverseT-rchild;printfn%cn,T-data;void PreOrderleafBiTreeT/*先序遍历输出二叉树中叶结点，丁为二叉树根结点的指针*/{if T!=NULL{ifT-lchild==NULLT-rchild==NULL printfn%cn,T-data;/*输出叶结点*/先序遍历左子树*/先序遍PreOrderleafT-lchild;/*PreOrderleafT-rchild;历右子树*/叩int Dth BiTreeT{//返回二叉树的深度int depthLeft=O;int depthRight=O;int depthval=O;if T==NULL depthval=0;else{depthLeft=Depth T-lchild;depthRight=Depth T-rchild;depthval=1+depthLeftdepthRightdepthLeft:depthRight;return depthval;void main{BiTrcc T;int depthval=0;二;//建立输出；T CreateBiTreePostOrdeiTraverseT;//printf”\n〃输出叶子节点PreOrderleafT;printfn\nn;depthval=Depth T;printfn%d,\depthval;getchar;二.运行结果J——■Mg11!■L・RB aM-77M■D:\zhouheng\course\schcxjl^^l\jS3E4^^\^^gS\5W

2015.

11.25\Mytree.exelABDGttttHttttttCttEFttttttGHDBFECA GHF4Process exitedafter342请按任意键继续••・\.8seconds withreturn value0JJ«WF。