数据结构实验五二叉树的操作

实验报告
本次实验基本达到了实验目的，但对求二叉树的深度的算法还不怎么理解。

编写
#include<iostream>
using namespace std;
typedef char ElemType;
struct BTreeLNode
{
BTreeLNode *left;
ElemType data;
BTreeLNode *right;
};
void InitBTree(BTreeLNode *&BT)/*初始化二叉树*/
{
BT=NULL;
}
void CreateBTree(BTreeLNode *&BT)/*创建二叉树*/
{
ElemType item;
cin>>item;
if(item=='0')
BT=NULL;
else
{
BT=new BTreeLNode;
BT->data=item;
CreateBTree(BT->left);
CreateBTree(BT->right);
}
}
void Preorder(BTreeLNode *&BT)/*先序遍历二叉树*/
{
if(BT==NULL)
cout<<" ";
else
{
cout<<BT->data;
Preorder(BT->left);
Preorder(BT->right);
}
}
void Inorder(BTreeLNode *&BT)/*中序遍历二叉树*/
{
if(BT==NULL)
cout<<" ";
else
{
Inorder(BT->left);
cout<<BT->data;
Inorder(BT->right);
}
}
void Postorder(BTreeLNode *&BT)/*后序遍历二叉树*/
{
if(BT==NULL)
cout<<" ";
else
{
Postorder(BT->left);
Postorder(BT->right);
cout<<BT->data;
}
}
int NumberofLeafNodes(BTreeLNode *&BT)/*求二叉树的叶子结点个数*/
{
int sum;
if(BT==NULL)
return 0;
if(BT->left==NULL&&BT->right==NULL)
return 1;
else
sum=NumberofLeafNodes(BT->left)+Numbero fLeafNodes(BT->right);
return sum;
}
int DepthBTree(BTreeLNode *&BT)/*求二叉树的深度*/
{
if(BT==NULL)
return 0;
else
{
int dep1=DepthBTree(BT->left);
int dep2=DepthBTree(BT->right);
if(dep1>dep2)
return dep1+1;
else
return dep2+1;
}
}
void DisplayBTree(BTreeLNode *&BT)/*显示二叉树*/
{
if(BT==NULL)
cout<<" ";
else
{
cout<<BT->data;
if(BT->left!=NULL||BT->right!=NULL)
{
cout<<"(";
if(BT->left==NULL)
cout<<" ";
else
DisplayBTree(BT->left);
if(BT->right!=NULL)
{
cout<<",";
DisplayBTree(BT->right);
cout<<")";
}
else
cout<<")";
}
}
}
void main()/*主函数*/
{
BTreeLNode *b;
InitBTree(b);
cout<<"一、创建二叉树<以（零）表示空>"<<endl;
CreateBTree(b);
cout<<"显示二叉树"<<endl;
DisplayBTree(b);cout<<endl;
cout<<"二、遍历二叉树"<<endl;
cout<<"1.先序遍历二叉树"<<endl;
Preorder(b);cout<<endl;
cout<<"2.中序遍历二叉树"<<endl;
Inorder(b);cout<<endl;
cout<<"3.后序遍历二叉树"<<endl;
Postorder(b);cout<<endl;
cout<<"该二叉树叶子结点的个数为";
cout<<NumberofLeafNodes(b)<<endl;
cout<<"该二叉树的深度为";
cout<<DepthBTree(b)<<endl;
}。