杭电1710 Binary Tree Traversals
来源:互联网 发布:mac怎么卸载itunes 编辑:程序博客网 时间:2024/05/18 02:00
Binary Tree Traversals
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2755 Accepted Submission(s): 1214
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#include<iostream>#define N 1005using namespace std;int preorder[N];int inorder[N];int postorder[N];void build(int n,int *s1,int *s2,int *s) //二叉树重建{ if(n<=0)return ; int p; for(int i=0;i<n;i++) //找根节点 if(s1[0]==s2[i]) { p=i; break; } build(p,s1+1,s2,s); //左二叉树的后序遍历 build(n-p-1,s1+p+1,s2+p+1,s+p); //右二叉树的后序遍历 s[n-1]=s1[0]; //根节点的保存}int main(){ int n; while(cin>>n) { for(int i=0;i<n;i++) cin>>preorder[i]; for(int j=0;j<n;j++) cin>>inorder[j]; build(n,preorder,inorder,postorder); for(int i=0;i<n-1;i++) cout<<postorder[i]<<' '; cout<<postorder[n-1]<<endl; } return 0;}
- 杭电 1710 Binary Tree Traversals
- 杭电1710 Binary Tree Traversals
- C语言 杭电ACM 1710 Binary Tree Traversals
- 杭电1710 Binary Tree Traversals(二叉树的遍历)
- 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
- 转:ios7(自动旋屏)iOS6不支持shouldAutorotateToInterfaceOrientation
- Android之ViewFilpperGroup
- 六、创建的新的工具条
- CreateThread()之后又马上CloseHandle()的问题
- 关于C++ 学习的几点 理解 之 c++关键字详解(volatile,mutable,explicit,dynamic_cast<T>(expression))等
- 杭电1710 Binary Tree Traversals
- 无题
- 2014年小米笔试题 蛇形矩阵打印
- Android读取txt文件乱码问题
- mysql一条语句删除多表(多表删除)
- 进击的数据结构二之线性表的链式结构
- 黑马程序员——StringBuilder(字符串拼接类)笔记
- 决定做程序员的第一篇
- jlink烧录程序小知识