1138 Postorder Traversal (25 分)
Suppose that all the keys in a binary tree are distinct positive integers. Given the preorder and inorder traversal sequences, you are supposed to output the first number of the postorder 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 (≤ 50,000), the total number of nodes in the binary tree. The second line gives the preorder 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 first number of the postorder traversal sequence of the corresponding binary tree.
Sample Input:
7
1 2 3 4 5 6 7
2 3 1 5 4 7 6
Sample Output:
3
题目大意:已知前序和中序,输出后序的第一个结点;
解题思路:
- 要在dfs的剪枝,即判断是否为后序的第一个结点,是的话就直接输出返回;
- 前序和中序的模板:
- 左子树:dfs(preR + 1,inL,i-1);
- 右子树:dfs(preR - inL + i + 1,i+1,inR);
#include <iostream>
#include <vector>
using namespace std;
#define rep(i,j,k) for(int i=j;i<k;i++)
vector<int> pre,in;
int cnt=0;
void dfs(int u,int l,int r){
if(l > r || cnt!=0)
return;
int i = l;
while(i<r && in[i] != pre[u]) i++;
dfs(u+1,l,i-1);
dfs(u-l+i+1,i+1,r);
if(cnt == 0)
printf("%d",pre[u]);
cnt++;
}
int main(){
std::ios::sync_with_stdio(false);
int n;
cin>>n;
in.resize(n);
pre.resize(n);
rep(i,0,n) cin>>pre[i];
rep(i,0,n) cin>>in[i];
dfs(0,0,n-1);
return 0;
}