ACM 数据结构-并查集 HDU 1710 Binary Tree Traversals .

原创 2016年05月30日 15:07:26
Problem Description
A binary tree is a finite set of vertices that is either empty or consists of a root r and two disjoint binary trees called the left and right subtrees. There are three most important ways in which the vertices of a binary tree can be systematically traversed or ordered. They are preorder, inorder and postorder. Let T be a binary tree with root r and subtrees T1,T2.

In a preorder traversal of the vertices of T, we visit the root r followed by visiting the vertices of T1 in preorder, then the vertices of T2 in preorder.

In an inorder traversal of the vertices of T, we visit the vertices of T1 in inorder, then the root r, followed by the vertices of T2 in inorder.

In a postorder traversal of the vertices of T, we visit the vertices of T1 in postorder, then the vertices of T2 in postorder and finally we visit r.

Now you are given the preorder sequence and inorder sequence of a certain binary tree. Try to find out its postorder sequence.
 

Input
The input contains several test cases. The first line of each test case contains a single integer n (1<=n<=1000), the number of vertices of the binary tree. Followed by two lines, respectively indicating the preorder sequence and inorder sequence. You can assume they are always correspond to a exclusive binary tree.
 

Output
For each test case print a single line specifying the corresponding postorder sequence.
 

Sample Input
9 1 2 4 7 3 5 8 9 6 4 7 2 1 8 5 9 3 6
 

Sample Output
7 4 2 8 9 5 6 3 1
 
首先根据前序列,确定根为1,。之后中序列1左边的为左分支,右边的为右分支。这样递归
#include<iostream>using namespace std;int t1[1001],t2[1001];void sousuo(int a,int b,int n,int flag){ if(n==1)//如果存在左子树或右子树就直接输出 { printf("%d ",t1[a]); return ; } else if(n<=0)//如果不存在左子树或右子树就返回上一层 return ; int i;//继续罚分为左子树和右子树 for(i=0;t1[a]!=t2[b+i];i++) ;//找到罚分点也就是根节点 sousuo(a+1,b,i,0);//左子树的遍历 sousuo(a+i+1,b+i+1,n-i-1,0);//右子树的遍历 if(flag==1)//最原始的跟节点 printf("%d",t1[a]); else//一般的根节点 printf("%d ",t1[a]);}int main(){ int n,i; while(scanf("%d",&n)!=EOF) { for(i=1;i<=n;i++) scanf("%d",&t1[i]);//t1中存的是前序 for(i=1;i<=n;i++)//t2中存的中序 scanf("%d",&t2[i]); sousuo(1,1,n,1); printf("\n"); } return 0;}
版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

数据结构之二叉树的遍历 HDU1710 Binary Tree Traversals

Binary Tree Traversals Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/...

hdu 1710:Binary Tree Traversals

给出几组二叉树的先序和中序遍历的节点序列,求出该二叉树的后序遍历序列。 先序遍历中第一个一定是根节点,然后找先序遍历中下一个节点在中序遍历中是在根节点的左边还是右边,左边则该节点在根结点的左...

HDU---1710-Binary Tree Traversals (二叉树遍历)

Binary Tree Traversals Time Limit : 1000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/O...

HDU1710Binary Tree Traversals

HDU1710Binary Tree Traversals题目大意:给一个树的前序遍历和中序遍历,要求输出后序遍历。 (半年前做这道题做了两天没看懂,今天学了二叉树,回来AC了^ ^) 首先介绍一...
  • wen_ruo
  • wen_ruo
  • 2015年03月30日 20:53
  • 240

hdu1710 Binary Tree Traversals ----- 二叉树前序中序推后序

原题链接: http://acm.hdu.edu.cn/showproblem.php?pid=1710 一:原题内容 Problem Description A binary tree i...
  • LaoJiu_
  • LaoJiu_
  • 2016年05月28日 22:31
  • 560

HDU1710 Binary Tree Traversals

Binary Tree Traversals Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/O...

HDU-1710-Binary Tree Traversals

/* Binary Tree Traversals Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Ja...

HDU1710:Binary Tree Traversals

Problem Description A binary tree is a finite set of vertices that is either empty or consists of...

hdu1710 Binary Tree Traversals

Binary Tree Traversals Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/O...

hdu 1710 Binary Tree Traversals 前序遍历和中序推后序

题意:给出前序历遍和中序遍历的顺序,来推导后序遍历的顺序。 做法:把握两个要点,前序是 先根历遍的,所以前序的第一个是根。然后这个根把中序分为两半,左边是左子树,右边是右子树。然后递归下就ok了。...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:ACM 数据结构-并查集 HDU 1710 Binary Tree Traversals .
举报原因:
原因补充:

(最多只允许输入30个字)