二叉树的顺序存储结构

#include
using namespace std;
#define Max 16


void Create_Tree(int *Tree,int *node,int length)
{
int i;
int level;
Tree[1]=node[1];
for(i=2;i {
level=1;
while(Tree[level]!=0)
{
if(node[i] level=2*level;
else
level=2*level+1;
}
Tree[level]=node[i];
}
}


int main()
{
int Tree[Max]={0};
int node[16]={0,18,6,65,5,69,61,14,7};// root=8
Create_Tree(Tree,node,16);
for(int i=1;i {
cout< if(i%5==0)
cout< }
cout<<"节点的双亲信息:"< int j,k,l;
for(j=1;j if(Tree[j]==Tree[1])
cout<<"根节点"< else
{
cout<<"节点"<    if(i%2==0)
cout< }
for(k=1;k if(Tree[k]==0)
cout< else
{
cout<<"节点"<    if(i%2==0)
cout< }
for(l=1;l if(Tree[2*l]==0&&Tree[2*l+1]==0)
cout<<"叶子"<
return 0;
}