A1119. Pre- and Post-order Traversals

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

 #include<cstdio>
 #include<iostream>
 #include<algorithm>
 #include<vector>
 using namespace std;
 int pre[], post[], N;
 typedef struct NODE{
     struct NODE* lchild, *rchild;
     int data;
 }node;
 int exam(int preL, int preR, int postL, int postR){
     if(preL > preR && postL > postR)
         return ;
     if(pre[preL] != post[postR])
         return ;
     int len = preR - preL;
     int ans = ;
     for(int i = ; i <= len; i++){
         ans += exam(preL + , preL + i, postL, postL -  + i) * exam(preL + i + , preR, postL + i, postR - );
     }
     return ans;
 }
 int create(int preL, int preR, int postL, int postR, node* &root){
     if(preL > preR && postL > postR){
         root = NULL;
         return ;
     }
     if(pre[preL] == post[postR]){
         root = new node;
         root->data = pre[preL];
         root->lchild = NULL;
         root->rchild = NULL;
     }else{
         return ;
     }
     int ans = ;
     int len = preR - preL;
     for(int i = ; i <= len; i++){
         ans = create(preL + , preL + i, postL, postL -  + i, root->lchild) && create(preL + i + , preR, postL + i, postR - , root->rchild);
         if(ans != )
             return ;
     }
     return ans;
 }
 vector<int> visit;
 void preOrder(node* root){
     if(root == NULL)
         return;
     preOrder(root->lchild);
     visit.push_back(root->data);
     preOrder(root->rchild);
 }

 int main(){
     scanf("%d", &N);
     for(int i = ; i <= N; i++){
         scanf("%d", &pre[i]);
     }
     for(int i = ; i <= N; i++){
         scanf("%d", &post[i]);
     }
     int ans = exam(, N, , N);
     node* root = NULL;
     create(, N, , N, root);
     preOrder(root);
     if(ans == )
         printf("Yes\n");
     else printf("No\n");
     for(int i = ; i < visit.size(); i++){
         if(i == visit.size() - )
             printf("%d\n", visit[i]);
         else printf("%d ", visit[i]);
     }
     return ;
 }

总结：

1、检验的方法：使用前序、中序递归建立二叉树的方法差不多。传入前序区间和后序区间之后，由前序和后序都可以确定树根。该序列的根合法的情况有：传入区间为空（即空树）； 前序确定的根和后序确定的根相同。 不合法的情况：前序与后序确定的树根不同。   然后将该序列划分为左右子树递归判断。有多种划分方法，需要循环。比如序列长为3，则可划分左右子树为(左0, 右3)  (左1, 右2)  (左2,右1)  (左3,右0)

2、需要注意的是，只有当该树的树根合法、左子树与右子树的划分合法，才能构成合法二叉树。划分种类数：左子树个数乘右子树个数。

3、递归建树则对上面的函数稍加改造即可， 核心方法就是找到根的序号并建立新节点存储根。