一、实验目的
1、熟练理解树和二叉树的相关概念,掌握的存储结构和相关操作实现;
2、掌握树的顺序结构的实现;
3、学会运用树的知识解决实际问题
二、实验内容
自己确定一个二叉树(树结点类型、数目和结构自定)利用顺序结构方法存储。实现树的构造,并完成:
1、层序输出结点数据;
2、以合理的格式,输出各个结点和双亲、孩子结点信息;
3、输出所有的叶子结点信息;
4、分析你的算法对于给定的二叉树的存储效率。
三,实验例子课本115页 图5-22
# include <iostream>
using namespace std;const int Maxsize=100;
class Binarytree
{
private:
char data[Maxsize];
int length;
public:
Binarytree(char a[],int n);
~Binarytree( ){ }
void Leverorder( );
void Checkpc(int i);
void Parch();
};
Binarytree::Binarytree(char a[],int n)
{
if(n>Maxsize || n<1 ) throw"非法参数";
for (int i=0;i<n;i++)
{
data[i]=a[i];
}
length=n;
}
void Binarytree::Checkpc(int i)
{
if(i>length) throw "非法查找";
if(data[i-1]!='#')
{
if(i/2>=0)
cout<<"结点i的双亲为"<<" "<<":"<<" "<<data[i/2-1]<<" ";
else
cout<<"结点i无双亲"<<endl;
if(data[2*i-1]=='#')
cout<<"结点i无左孩子"<<" ";
else
cout<<"结点i的左孩子为:"<<" "<<":"<<" "<<data[2*i-1]<<endl;
if(data[2*i]=='#')
cout<<"结点i无右孩子"<<" ";
else
cout<<"结点i的右孩子为:"<<" "<<":"<<" "<<data[2*i]<<endl;
}
}
void Binarytree::Leverorder( )
{
for(int i=0;i<length;i++)
{
if(data[i]!='#')
cout<<data[i];
}
}
void Binarytree::Parch( )
{ for(int i=0;i<length;i++)
{ if(data[0]!='#')
{cout<<"结点i没有双亲"<<endl;
cout<<"结点i的左孩子为:"<<" "<<":"<<" "<<data[2*i-1]<<endl;
cout<<"结点i的右孩子为:"<<" "<<":"<<" "<<data[2*i]<<endl;}
else
if(data[i-1]=='#' && data[(i-1)/2]=='#')
cout<<"结点i既没有双亲,也没有孩子";
if(data[i-1]=='#' && data[(i-1)/2]!='#')
cout<<"结点i的双亲为:"<<" "<<":"<<" "<<data[(i-1)/2]<<endl;
cout<<"结点i没有孩子 "<<endl;
if(data[i-1]!='#'&& data[2*i-1]!='#'&&data[2*i]!='#')
cout<<"结点i的双亲为:"<<" "<<":"<<" "<<data[(i-1)/2]<<endl;
cout<<"结点i的左孩子为:"<<" "<<":"<<" "<<data[2*i-1]<<endl;
cout<<"结点i的右孩子为:"<<" "<<":"<<" "<<data[2*i]<<endl;
if(data[i-1]!='#'&& data[2*i-1]!='#'&&data[2*i]=='#')
cout<<"结点i的双亲为:"<<" "<<":"<<" "<<data[(i-1)/2]<<endl;
cout<<"结点i的左孩子为:"<<" "<<":"<<" "<<data[2*i-1]<<endl;
cout<<"结点i没有右孩子:"<<endl;
if(data[i-1]!='#'&& data[2*i-1]=='#'&&data[2*i]!='#')
cout<<"结点i的双亲为:"<<" "<<":"<<" "<<data[(i-1)/2]<<endl;
cout<<"结点i没有左孩子:"<<endl;
cout<<"结点i的右孩子为:"<<" "<<":"<<" "<<data[2*i]<<endl;
if(data[i-1]!='#'&& data[2*i-1]=='#'&&data[2*i]=='#')
cout<<"结点i的双亲为:"<<" "<<":"<<" "<<data[(i-1)/2]<<endl;
cout<<"结点i没有左孩子:"<<endl;
cout<<"结点i没有右孩子:"<<endl;};
}
int main()
{
char p[13]={'A','B','C','#','D','E','#','#','#','F','#','#','G'};
Binarytree k(p,13);
cout<<"该二叉树的层序输出为:";
k.Leverorder();
cout<<endl;
cout<<"输入要查询的结点为";
int a;
cin>>a;
k.Checkpc(a);
cout<<endl;
k.Parch();
cout<<endl;
return 0;
}