浙大PAT 1102

//关键在于找到根节点

#include<iostream>

#include<fstream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<math.h>
#include<string>
#include <iomanip> 
using namespace std;
int N;
int t=0;
struct  node
{
int value;
int left,right;
};
struct treenode
{
int value;
treenode*left,*right;
treenode(){left=right=NULL;value=0;}
};
node *data;
vector<int> tree;
void findroot(int index)
{
if(index==N)
return;
else
{
tree.push_back(data[index].value);
//tree.push_back(data[index].value);
if(data[index].left!=-1)
{
findroot(data[index].left);
}
if(data[index].right!=-1)
{
findroot(data[index].right);
}
}
}
treenode *maketree(int index)
{
if(index==N)
return NULL;
else
{
treenode *temp=new treenode;
temp->value=data[index].value;
if(data[index].left!=-1)
{
temp->left=maketree(data[index].left);
}
if(data[index].right!=-1)
{
temp->right=maketree(data[index].right);
}
return temp;
}
}
void printtreeinorder(treenode *p)
{
if(p)
{
printtreeinorder(p->left);
if(t==0)
cout<<p->value;
else
cout<<" "<<p->value;
t=1;
printtreeinorder(p->right);
}
}
void printtreeleorder(queue<treenode*>p)
{
if(p.size())
{
treenode* top=p.front();
if(t==0)
cout<<top->value;
else
cout<<" "<<top->value;
t=1;
p.pop();
if(top->left)
{
p.push(top->left);
}
if(top->right)
{
p.push(top->right);
}
printtreeleorder(p);
}
}
//#define fin cin  
int main()  
{  

/*ifstream fin("d:\in.txt" ); 
if (! fin.is_open())  
{ 
cout << "Error opening file";
system("pause");
exit (1); 
}*/
cin>>N;
char a,b;
data=new node[N];
for(int i=0;i<N;i++)
{
cin>>a>>b;
data[i].value=i;
if(a=='-')
data[i].right=-1;
else
data[i].right=a-48;
if(b=='-')
data[i].left=-1;
else
data[i].left=b-48;
}
int root=0;
for(int i=0;i<N;i++)
{
tree.clear();
findroot(i);
if(tree.size()==N)
{
root=i;
break;
}
}//data[6] data[7] data[5]
treenode *mytree=maketree(root);


queue<treenode*>p;
p.push(mytree);
printtreeleorder(p);
t=0;
cout<<endl;
printtreeinorder(mytree);
system("PAUSE");  
    return 0;  
}