#include<iostream>
#include<cstring>
using namespace std;
class BiTree
{
public:
BiTree();
~BiTree();
int calculatenode(int t,int&n);
int PreOrder(int n);
int InOrder(int n);
int PostOrder(int n);
int LevelOrder(int n);
int visit(int n);
int Depth(int n);
int Tree[100];
int Create();
int max(int a,int b);};
BiTree::BiTree()
{memset(Tree,0,sizeof(Tree));}
BiTree::~BiTree()
{}
int BiTree::Create()
{int n,i=1;
while(cin>>n&&n!=-1)
{Tree[i]=n;
i++;
}
return 0;}
int BiTree::visit(int n)
{if(Tree[n]!=-1&&Tree[n]!=0)
cout<<Tree[n]<<" ";
return 0;
}
int BiTree::PreOrder(int n)
{if(Tree[n]!=-1&&Tree[n]!=0)
{visit(n);
PreOrder(2*n);
PreOrder(2*n+1);
}
return 0;
}
int BiTree::InOrder(int n)
{if(Tree[n]!=-1&&Tree[n]!=0)
{
InOrder(2*n);
visit(n);
InOrder(2*n+1);
}
return 0;
}
int BiTree::PostOrder(int n)
{if(Tree[n]!=-1&&Tree[n]!=0)
{PostOrder(2*n);
PostOrder(2*n+1);
visit(n);
}
return 0;}
int BiTree::calculatenode(int i,int&n)
{if(Tree[i]!=-1&&Tree[i]!=0)
{n++;
calculatenode(2*i,n);
calculatenode(2*i+1,n);
}
return 0;
}
int BiTree::Depth(int n)
{if(Tree[n]!=-1&&Tree[n]!=0)
return max(Depth(2*n),Depth(2*n+1))+1;
}
int BiTree::max(int a,int b)
{return a>b?a:b;}
int main()
{BiTree B;
int n=0;
B.Create();
cout<<"二叉树的先序遍历:";
B.PreOrder(2);
cout<<endl;
cout<<"二叉树的中序遍历:";
B.InOrder(2);
cout<<endl;
cout<<"二叉树的后序遍历:";
B.PostOrder(2);
cout<<endl;
B.calculatenode(2,n);
cout<<"结点数为:"<<n<<endl;
n=B.Depth(2);
cout<<"深度为:"<<n<<endl;
return 0;
}