PAT 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
【解题思路】
经典的二叉树问题。
这道题给出二叉树的后序遍历和中序遍历,要求我们输出层序遍历(BFS顺序)。
我们采用递归建树,然后使用BFS层序遍历输出即可。
【满分代码】
#include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
int post[35],in[35];
struct node
{
int data;
node *lchild,*rchild;
};
node* build(int postL,int postR,int inL,int inR)
{
if(postL>postR)
return NULL;
node* root=new node;
root->data=post[postR];
int k;
for(k=inL;k<=inR;k++)
if(in[k]==post[postR])
break;
int num=k-inL;
root->lchild=build(postL,postL+num-1,inL,k-1);
root->rchild=build(postL+num,postR-1,k+1,inR);
return root;
}//递归建二叉树
void BFS(node* root)
{
int d=root->data;
queue<node*> q;
q.push(root);
while(!q.empty())
{
node* t=q.front();
q.pop();
if(t->data==d)
cout<<d;
else
cout<<" "<<t->data;
if(t->lchild)
q.push(t->lchild);
if(t->rchild)
q.push(t->rchild);
}
}//层序遍历
int main()
{
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int n;
cin>>n;
for(int i=0;i<n;i++)
cin>>post[i];
for(int i=0;i<n;i++)
cin>>in[i];
node* root=build(0,n-1,0,n-1);
BFS(root);
return 0;
return 0;
}