1119. Pre- and Post-order Traversals (30)-PAT甲级真题（前序后序转中序）

题目描述

Suppose that all the keys in a binary tree are distinct positive integers. A unique binary tree can be determined by a given pair of postorder and inorder traversal sequences, or preorder and inorder traversal sequences. However, if only the postorder and preorder traversal sequences are given, the corresponding tree may no longer be unique.

Now given a pair of postorder and preorder traversal sequences, you are supposed to output the corresponding inorder traversal sequence of the tree. If the tree is not unique, simply output any one of them.

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 preorder sequence and the third line gives the postorder sequence. All the numbers in a line are separated by a space.

Output Specification:

For each test case, first printf in a line Yes if the tree is unique, or No if not. Then print in the next line the inorder traversal sequence of the corresponding binary tree. If the solution is not unique, any answer would do. It is guaranteed that at least one solution exists. 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 1:

7
1 2 3 4 6 7 5
2 6 7 4 5 3 1

Sample Output 1:

Yes
2 1 6 4 7 3 5

Sample Input 2:

4
1 2 3 4
2 4 3 1

Sample Output 2:

No
2 1 3 4

 

/*
 * @Descripttion: 
 * @version: 
 * @Author: iDestro
 * @Date: 2019-08-28 21:49:14
 * @LastEditors: iDestro
 * @LastEditTime: 2019-08-29 20:07:52
 */
#include <iostream>
#include <vector>
using namespace std;
vector<int> pre, post;

struct Node {
    int val;
    Node *left, *right;
    Node(int x) {
        this -> val = x;
        this -> left = this -> right = NULL;
    }
};

bool flag = true;
Node *create(int preL, int preH, int postL, int postH) {
    if (preL > preH) {
        return NULL;
    }
    // 子树的节点是否为1个，如果为1个，则无法确定是左孩子还是右孩子  
    if (preH - preL == 1) flag = false;
    Node *root = new Node(pre[preL]);
    int k;
    // 以后序前一个节点为划分，在前序找到值相同的节点，该节点左边除前序第一个节点为左子树，该节点及该节点右边的为右子树
    for (k = preL; k <= preH && pre[k] != post[postH-1]; k++);
    // 左子树节点的个数
    int leftNum = k-preL-1;
    // 划分左右子树
    root -> left = create(preL+1, preL+leftNum, postL, postL+leftNum-1);
    root -> right = create(preL+leftNum+1, preH, postL+leftNum, postH-1);
    return root;
}

int n, cnt = 0;

void inOrder(Node *root) {
    if (root != NULL) {
        inOrder(root -> left);
        cout << root -> val;
        cnt++;
        if (cnt < n) {
            cout << " ";
        }
        inOrder(root -> right);
    }
}

int main() {
    cin >> n;
    pre.resize(n);
    post.resize(n);
    for (int i = 0; i < n; i++) {
        cin >> pre[i];
    }
    for (int i = 0; i < n; i++) {
        cin >> post[i];
    }
    Node *root = create(0, n-1, 0, n-1);
    cout << (flag ? "Yes" : "No") << endl;
    inOrder(root);
    cout << endl;
    return 0;
}