PAT A1119:Pre- and Post-order Traversals之前序、后序遍历序列建树

题目描述

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

求解思路

  • 给定n个节点的前序、后序遍历序列要求我们判断构造的树是否唯一,且输出中序遍历序列。
  • 假设我们要构造create(preL,preR,postL,postR),如果preL>preR,那么返回空结点;如果preL==preR,则新建一个结点给它赋值,并且该结点的左子节点和右子节点为空。如果pre[preL+1]等于post[postR-1]位置的值,则说明建的树不唯一,否则是唯一的。
  • 从preL+1处开始找到一个pos使得pre[pos]与post[postR-1]相等的值相等,则跳出循环,左子树为create(preL+1,pos-1,postL,postL+pos-preL-2),右子树为create(pos,preR,postL+pos-preL-1,postR-1)

代码实现(AC)

#include<cstdio>
struct Node{
	int data;
	Node *lchild;
	Node *rchild;
};
int pre[30],post[30],n;
bool flag=true;
Node* create(int preL,int preR,int postL,int postR)
{
	if(preL>preR)	return NULL;
	if(preL==preR)	
	{
		Node *root=new Node;
		root->data=pre[preL];
		root->lchild=NULL;
		root->rchild=NULL;
		return root; 
	}
	if(pre[preL+1]==post[postR-1])	flag=false;
	Node *root=new Node;
	root->data=pre[preL];
	int pos=preL+1;
	for(;pos<=preR;pos++)
	{
		if(pre[pos]==post[postR-1])	break;
	}
	root->lchild=create(preL+1,pos-1,postL,postL+pos-preL-2);
	root->rchild=create(pos,preR,postL+pos-preL-1,postR-1);
	return root;
}
int cnt=0;
void inorder(Node *root)
{
	if(root==NULL)	return;
	inorder(root->lchild);
	if(++cnt==n)	printf("%d\n",root->data);
	else printf("%d ",root->data); 
	inorder(root->rchild);
}
void solve()
{
	scanf("%d",&n);
	for(int i=0;i<n;i++)
		scanf("%d",&pre[i]);
	for(int i=0;i<n;i++)
		scanf("%d",&post[i]);
	Node *root=create(0,n-1,0,n-1);
	if(flag)	printf("Yes\n");
	else printf("No\n");
	inorder(root); 
}
int main()
{
	solve();
	return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值