hdu 1710 Binary Tree Traversals
来源:互联网 发布:软件行业销售模式 编辑:程序博客网 时间:2024/06/02 05:37
题目链接:点击打开链接
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.
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
91 2 4 7 3 5 8 9 64 7 2 1 8 5 9 3 6
Sample Output
7 4 2 8 9 5 6 3 1
<span style="font-size:24px;">#include <iostream>#include<cstdio>#include<cstdlib>#include<cstring>using namespace std;struct node{ int data; struct node *l,*r;};struct node *creat(int a[],int b[],int n){ if(n<=0)return NULL; struct node *root; root=new node; root->l=NULL; root->r=NULL; root->data=a[0]; int i; for(i=0;i<n;i++) { if(a[0]==b[i])break; } int k=i; root->l=creat(a+1,b,k); root->r=creat(a+1+k,b+1+k,n-1-k); return root;}int f=1;void past(struct node *root){ if(root!=NULL) { past(root->l); past(root->r); if(f==1) { printf("%d",root->data); f=0; } else printf(" %d",root->data); } return ;}int main(){ int a[1005],b[1005]; int n; while(cin>>n) { for(int i=0;i<n;i++) { cin>>a[i]; } for(int i=0;i<n;i++) { cin>>b[i]; } struct node *root; root=new node; root=creat(a,b,n); f=1; past(root); printf("\n"); } return 0;}</span>
0 0
- HDU 1710-Binary Tree Traversals
- HDU 1710 Binary Tree Traversals
- HDU--1710 -- Binary Tree Traversals
- hdu--1710Binary Tree Traversals
- hdu 1710 Binary Tree Traversals
- Hdu--1710--Binary Tree Traversals
- HDU-1710-Binary Tree Traversals
- hdu-1710-Binary Tree Traversals
- HDU 1710 Binary Tree Traversals
- hdu 1710:Binary Tree Traversals
- HDU 1710 Binary Tree Traversals
- HDU-1710-Binary Tree Traversals
- HDU 1710 Binary Tree Traversals
- HDU - 1710 Binary Tree Traversals
- hdu 1710 Binary Tree Traversals
- hdu 1710 Binary Tree Traversals
- hdu 1710 Binary Tree Traversals
- hdu 1710 Binary Tree Traversals
- Java/Android引用类型及其使用分析
- c/c++和java实现swap函数的不同处
- 动态Button的android:drawableTop
- 使用jdbc-pool替代dbcp、c3p0等连接池的原因
- 树莓派使用USB数据线连接到手机的USB共享上网
- hdu 1710 Binary Tree Traversals
- Tomcat的JDBC连接池
- NOIP2007 矩阵取数 DP+高精度
- MyBatis 3.2.x版本在并发情况下可能出现的bug及解决办法
- java中this用法
- 感谢这一年的尚不如愿,这是下一年必须努力的理由
- Spring Boot实战之单元测试
- 数据结构实验之栈八:栈的基本操作
- 嵌入式系统原理及接口技术 ARM9体系结构