顺序存储上面二叉树
#include<iostream.h>
const int Maxsize=50;
class Tree
{
public:
Tree();
~Tree(){}
int Create();
void LeverOrder();
void Print();
void Printleaf();
int tree[Maxsize];
int count;
int num;
};
Tree::Tree()
{
for(int i=0;i<Maxsize;i++)
tree[i]=-1;
count=0;
}
int Tree::Create()
{
int n,i=1;
num=0;
count=0;
cout<<"请按照从上到下、从左到右的顺序依次输入二叉树各个结点,空节点用0表示,以-1表示输入结束:"<<endl;
while(cin>>n&&n!=-1&&i<Maxsize)
{
tree[i]=n;
i++;
num++;
if(n==0) continue;
else count++;
}