1119 Pre- and Post-order Traversals (30 分)

Posted 2022-06-29 zllwxm123

1119 Pre- and Post-order Traversals (30 分)

 

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

 

这题还是挺不错的，挺锻炼思维的，以前没有做过用前序和后序来确定一棵树，

仔细分析一下还是后规律可循。

所以我就递归求解了。

 

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 int n,pre[40],post[40];
 4 struct Node
 5 
 6     int val;
 7     Node *left, *right;
 8 ;
 9 bool flag = true;
10 vector<int> v;
11 Node* build(int ll, int rr, int lt, int rt)
12     Node *ans = new Node();
13     ans->val = post[rt];
14     ans->left = ans->right = NULL;
15     if(ll == rr) return ans;
16     int cnt = 0;
17     for(int i = ll+1; i <= rr; i++)
18         if(pre[i] == post[rt-1])
19             cnt = i;
20     
21     if(rr - ll == 1) flag = false;
22     if(cnt > ll+1)
23         ans->left = build(ll+1,cnt-1,lt, lt+cnt-ll-2);
24     
25     if(cnt <= rr)
26         ans->right = build(cnt,rr,rt+cnt-rr-1,rt-1);
27     
28     return ans;
29 
30 void output(Node *tree)
31     if(tree != NULL)
32         output(tree->left);
33         v.push_back(tree->val);
34         output(tree->right);
35     
36 
37 int main()
38     cin >> n;
39     for(int i = 0; i < n; i++)
40         cin >> pre[i];
41     for(int i = 0; i < n; i++)
42         cin >> post[i];
43     Node *tree = NULL;
44     tree = build(0, n-1, 0, n-1);
45     if(flag)
46         cout <<"Yes"<<endl;
47     else
48         cout <<"No"<<endl;
49     output(tree);
50     for(int i = 0; i < v.size(); i++)
51         printf("%d%c",v[i], i == v.size()-1?‘\n‘:‘ ‘);
52     return 0;
53