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
==============================================
前序中序转后序。
手算很容易,这是第一次用代码实现。
每一次,先序确定根,中序通过根确定左右子树。
递归地去左右子树找。
=============================================
#include <iostream>
#include <vector>
using namespace std;
vector<int> pre, in;
bool flag = false;
void post (int prel, int inl, int inr){
if(inl > inr || flag == true) return;
int i = inl;
while(in[i] != pre[prel]) i++;
post(prel + 1, inl, i - 1);//左子树
post(prel + i - inl + 1, i + 1, inr);//右子树
if(flag == false){
printf("%d", in[i]);
flag = true;
}
}
int main(){
int n;
cin >> n;
pre.resize(n), in.resize(n);
for(int i = 0; i < n; i++)
scanf("%d", &pre[i]);
for(int i = 0; i < n; i++)
scanf("%d", &in[i]);
post(0, 0, n - 1);
return 0;
}