1020 Tree Traversals (25 分)
Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, you are supposed to output the level order traversal sequence of the corresponding binary tree.
Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N (≤30), the total number of nodes in the binary tree. The second line gives the postorder sequence and the third line gives the inorder sequence. All the numbers in a line are separated by a space.
Output Specification:
For each test case, print in one line the level order traversal sequence of the corresponding binary tree. All the numbers in a line must be separated by exactly one space, and there must be no extra space at the end of the line.
Sample Input:
7
2 3 1 5 7 6 4
1 2 3 4 5 6 7
Sample Output:
4 1 6 3 5 7 2
#include <bits/stdc++.h>
using namespace std;
typedef struct BTnode
{
int data;
struct BTnode *l;
struct BTnode *r;
}BTnode;
BTnode *create(int *post,int *in,int n)
{
BTnode *b;
int *p;
int k,r;
if(n<=0)
return NULL;
r=*(post+n-1);
b=(BTnode *)malloc(sizeof(BTnode));
b->data=r;
for(p=in;p<in+n;p++)
if(*p==r)
break;
k=p-in;
b->l=create(post,in,k);
b->r=create(post+k,p+1,n-k-1);
return b;
}
void level(BTnode *b)
{
queue <BTnode *> qu;
BTnode *q;
qu.push(b);
int f=1;
while(!qu.empty())
{
q=qu.front();
qu.pop();
if(f==1)
{
cout<<q->data;
f=0;
}
else
cout<<" "<<q->data;
if(q->l!=NULL)
qu.push(q->l);
if(q->r!=NULL)
qu.push(q->r);
}
}
int main()
{
BTnode *B;
int i,n;
int a[51],b[51];
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
}
for(i=0;i<n;i++)
{
cin>>b[i];
}
B=create(a,b,n);
level(B);
return 0;
}