#include<iostream>
using namespace std;
const int MaxSize=100;
//template<class DataType>
class Bitree
{
private:
void printr(int x,int y);
char data[MaxSize];
int length;
public:
Bitree(char a[],int n);
~Bitree(){}
void LeverOrder(); //层序输出
void search(int i); //查询结点i的双亲、孩子
void Parch(); //输出双亲孩子信息
void Leaf(); //输出叶子信息
};
using namespace std;
const int MaxSize=100;
//template<class DataType>
class Bitree
{
private:
void printr(int x,int y);
char data[MaxSize];
int length;
public:
Bitree(char a[],int n);
~Bitree(){}
void LeverOrder(); //层序输出
void search(int i); //查询结点i的双亲、孩子
void Parch(); //输出双亲孩子信息
void Leaf(); //输出叶子信息
};
Bitree::Bitree(char a[],int n)
{
if(n>MaxSize||n<1)throw "非法";
for(int i=0;i<n;i++)
data[i]=a[i];
length=n;
}
{
if(n>MaxSize||n<1)throw "非法";
for(int i=0;i<n;i++)
data[i]=a[i];
length=n;
}
void Bitree::LeverOrder()
{
for (int i=1;i<length;i++)
{
if(data[i]!='\0')
cout <<data[i];
}
}
{
for (int i=1;i<length;i++)
{
if(data[i]!='\0')
cout <<data[i];
}
}
void Bitree::printr(int x,int y)
{
int left=2*x;
int right=2*x+1;
int p=x/2;
if(data[x-1]!='\0')
{
if(p>=1)
cout<<"结点"<<y<<" : "<<data[x-1]<<"\t双亲"<<data[p-1]<<" ";
else
cout<<"结点"<<y<<" : "<<data[x-1]<<"\t无双亲"<<data[p-1]<<" ";
if(data[left-1]!='\0'&&left<=length)
cout <<"\t左孩子"<<data[left-1]<<" ";
else
cout <<"\t无左孩子"<<" ";
if(data[right-1]!='\0'&&right<=length)
cout <<"\t右孩子"<<data[right-1]<<" ";
else
cout <<"\t无左孩子"<<" ";
cout<<endl;
}
}
{
int left=2*x;
int right=2*x+1;
int p=x/2;
if(data[x-1]!='\0')
{
if(p>=1)
cout<<"结点"<<y<<" : "<<data[x-1]<<"\t双亲"<<data[p-1]<<" ";
else
cout<<"结点"<<y<<" : "<<data[x-1]<<"\t无双亲"<<data[p-1]<<" ";
if(data[left-1]!='\0'&&left<=length)
cout <<"\t左孩子"<<data[left-1]<<" ";
else
cout <<"\t无左孩子"<<" ";
if(data[right-1]!='\0'&&right<=length)
cout <<"\t右孩子"<<data[right-1]<<" ";
else
cout <<"\t无左孩子"<<" ";
cout<<endl;
}
}
void Bitree::search(int x)
{
int count=1;
for(int i=1;i<=length;i++)
{
if(data[i-1]!='\0')
{
if(count==x)
{
printr(i,x);
return;
}
else{count++;}
}
}
}
void Bitree::Parch()
{
for(int i=1;i<length;i++)
search(i);
}
{
int count=1;
for(int i=1;i<=length;i++)
{
if(data[i-1]!='\0')
{
if(count==x)
{
printr(i,x);
return;
}
else{count++;}
}
}
}
void Bitree::Parch()
{
for(int i=1;i<length;i++)
search(i);
}
void Bitree::Leaf()
{
int a1,a2;
for(int i=1;i<=length;i++)
{
a1=2*i;
a2=2*i+1;
if(data[a1-1]=='\0'&&data[a2-1])
cout<<data[i-1];
if(a1>length&&data[i-1]!='\0')
cout<<data[i-1];
}
}
{
int a1,a2;
for(int i=1;i<=length;i++)
{
a1=2*i;
a2=2*i+1;
if(data[a1-1]=='\0'&&data[a2-1])
cout<<data[i-1];
if(a1>length&&data[i-1]!='\0')
cout<<data[i-1];
}
}
int main()
{
char a[13]={'A','B','C','D','E','!','@','1','2','#','\0','3','4'};
Bitree c(a,13);
cout<<"层序输出:";
c.LeverOrder();
cout<<endl;
cout<<"输出结点关系:"<<endl;
c.Parch();
cout<<endl;
cout<<"叶子结点:";
c.Leaf();
cout<<endl;
return 0;
}
{
char a[13]={'A','B','C','D','E','!','@','1','2','#','\0','3','4'};
Bitree c(a,13);
cout<<"层序输出:";
c.LeverOrder();
cout<<endl;
cout<<"输出结点关系:"<<endl;
c.Parch();
cout<<endl;
cout<<"叶子结点:";
c.Leaf();
cout<<endl;
return 0;
}