确定一个二叉树利用顺序结构方法存储。
源代码:
#include<iostream.h>
const int MaxSize=100;class BinaryTree{
public:
BinaryTree(char a[],int n);
~BinaryTree(){}
void Leveroder(); //层序输出
void Search(int i); //查询结点i的亲/孩子
void Parch(); //输出双亲/孩子的信息
void Leaf(); //输出叶子信息
private:
void PrintR(int x,int y);
char data[MaxSize];
int length;
};
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::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 BinaryTree::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无双亲"<<" ";
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 BinaryTree::Leveroder()
{
for(int i=0;i<length;i++)
{
if(data[i]!='\0')
cout<<data[i];
}
}
void BinaryTree::Parch()
{
for(int i=1;i<=length;i++)
Search(i);
}
void BinaryTree::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]=='\0' && data[i-1]!='\0')
cout<<data[i-1];
if(a1>length && data[i-1]!='\0')
cout<<data[i-1];
}
}
int main(int argc,const char * argv[])
{
char b[13]={'a','b','c','d','\0','e','f','\0','g','\0','\0','\0','\0'};
BinaryTree c(b,13);
cout<<"该二叉树的层序输出为:";
c.Leveroder();
cout<<endl;
cout<<"输出所有关系"<<endl;
c.Parch();
cout<<endl;
cout<<"叶子结点为:";
c.Leaf();
cout<<endl;
return 0;
}
运行结果图: