1138. Postorder Traversal (25)/前序和中序重建二叉树

1138. Postorder Traversal (25)

时间限制

600 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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 (<=50000), 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<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
struct tree{
	int num;
	tree *l;
	tree *r;
};


int pre[50000+10];
int in[50000+10];

tree *build(int pl,int pr,int il,int ir)
{
	tree *T=(tree*)malloc(sizeof(tree));
	if(pl>pr) return NULL;
	T->num=pre[pl];
	if(pl==pr) return T;
	int k;
	for(k=il;k<=ir;k++)
	{
		if(pre[pl]==in[k])
			break;
	}
	T->l=build(pl+1,pl+k-il,il,k-1);
	T->r=build(pl+k-il+1,pr,k+1,ir);
	return T; 
}
bool flag=false;
void travel(tree *T)
{
	if(T->l) travel(T->l);
	if(T->r) travel(T->r);
	if(!flag)
	{
		printf("%d\n",T->num);
		flag=true;
	}
}

int main()
{
	int n;
	scanf("%d",&n);
	for(int i=0;i<n;i++)
		scanf("%d",&pre[i]);
	for(int i=0;i<n;i++)
		scanf("%d",&in[i]);
	tree *T=build(0,n-1,0,n-1);
	travel(T);
	return 0;
}