树的双亲表示法

#include
#include
#include
#define size 100
using namespace std;
typedef struct Pa_node
{
char data;
int parent;
}Pa_node;



typedef struct Ptree
{
Pa_node shuzu[size];
int root;
int number;//节点个数
}Ptree,*Ptree_lk;


void initree(Ptree_lk &bt)
{cout<<"输入节点个数"<<"number=";
cin>>bt->number;
cout<<endl;
cout<<"创建双亲树表"<<endl;
for(int i=0;i<=bt->number-1;i++)
{
cin>>bt->shuzu[i].data>>bt->shuzu[i].parent;

}

}

void print(Ptree_lk &bt)
{
cout<<"下标位置"<<"\t"<<"数据节点"<<"\t"<<"双亲位置"<<endl;
for(int i=0;i<=bt->number-1;i++)
{
cout<<i<<"\t"<<bt->shuzu[i].data<<"\t"<<bt->shuzu[i].parent<<endl;
}
}


main()
{
Ptree_lk bt;
bt=new Ptree;
initree(bt);
print(bt);


}