pat根据中序遍历和先序遍历_pat甲1119. 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

tips:一个小时的时间都是浪费在 把Yes打成YES上。说明复制粘贴和细心的重要性。

1.题意：根据前序遍历和后序遍历建树，输出中序遍历序列，序列可能不唯一，输出其中一个即可。

已知前序遍历和后序遍历序列，是无法确定一棵二叉树的，原因在于如果只有一棵子树可能是左孩子也有可能是右孩子。

可以发现前序的第一个和后序的最后一个为根节点root，前序的第二个值val为其某子树的根节点

在后序中找对应的值所在的位置，则之前的节点均为val的孩子节点。

若num个数=preR-preL-1，即val后面的个数都是其子节点，那么二叉树不唯一，将其作为root的左子树处理。

递归划分：

1 (2) [3 {4 6 7} <5>]

(2) [{6 7 4} <5> 3] 1

不同的括号对应不同的子树区间

第一次递归划分了(2)-(2),[3 4 6 7 5]-[6 7 4 5 3]

由于(2)只有一棵，不继续划分。

第二次递归划分了{4 6 7}-{6 7 4},<5>-<5>

第三次递归划分了(6)-(6),(7)-(7)

结束

#include

#include

using namespace std;

int n;

int pre[40000];//前序序列

int post[40000];//后序序列

int rt;int t[40000][2];//根，数组模拟二叉树

int flag;//用于格式输出

//判断是否能建起一棵树

int ttry(int l,int r,int ll,int rr){

//当l>r时成功的建立起了一棵树

if(l>r)return 1;

//前序的第一个 和 后序的最后一个 一定的都是根

if(pre[l]!=post[rr])return 0;

int ret=0;

for(int i=l;i<=r;i++)

{

//递归处理左子树 // i-l-1 比左端点多出的数目

int L=ttry(l+1,i,ll,ll+i-l-1);

//递归处理右子树

int R=ttry(i+1,r,ll+i-l,rr-1);

//只有返回值都是1，才增加1

ret+=L*R;

}

return ret;

}

bool build(int &x,int l,int r,int ll,int rr){

//成功建起一棵树

if(l>r)return true;

if(pre[l]!=post[rr])return false;

//根节点

x=pre[l];

for(int i=l;i<=r;i++)

{

//建立左子树，右子树

if(build(t[x][0],l+1,i,ll,ll+i-l-1)

&&build(t[x][1],i+1,r,ll+i-l,rr-1))

return true;

}

return false;

}

void dfs(int x){

if(!x)return;

dfs(t[x][0]);

printf("%s%d",flag?" ":"",x);flag=1;

dfs(t[x][1]);

}

int main(){

cin>>n;

for(int i=1;i<=n;i++)cin>>pre[i];

for(int i=1;i<=n;i++)cin>>post[i];

int cnt=ttry(1,n,1,n);

printf("%s\n",(cnt>1)?"No":"Yes");

build(rt=0,1,n,1,n);

dfs(rt);

cout<

return 0;

}