1138 Postorder Traversal 甲级 xp_xht123

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<map>

using namespace std;
const int N = 1e5 + 10;
struct Node
{
    int val;
    Node*right = NULL ,*left = NULL;
};

int perorder[N] , inorder[N];
map<int,int>mp;

Node*build(int il , int ir , int pl , int pr)
{
    if(il > ir) return NULL;
    Node *root = new Node;
    root -> val = perorder[pl];
    int k = mp[root -> val];
    root -> left = build(il , k - 1 , pl + 1 , pl - il + k);
    root -> right = build(k + 1 , ir , pr - ir + k + 1 , pr);
    return root;
}

bool flag = true;

void dfs(Node *r)
{
    if(r == NULL) return ;
    dfs(r -> left);
    dfs(r -> right);
    if(flag)
    {
        cout<<r -> val;
        flag = false;
    }
}

int n;
int main()
{
    cin>>n;
    for(int i = 0;i < n;i ++) cin>>perorder[i];
    for(int i = 0;i < n;i ++)
    {
        cin>>inorder[i];
        mp[inorder[i]] = i;
    }
    
    Node *root = build(0 , n - 1 , 0 , n - 1);
    
    dfs(root);
    return 0;
}