【二叉树之遍历的应用】HDU 1710---Binary Tree Traversals
来源:互联网 发布:淘宝上代接信用卡电话 编辑:程序博客网 时间:2024/05/21 17:07
Binary Tree Traversals
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3270 Accepted Submission(s): 1471
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>#include <algorithm>#include<stdio.h>using namespace std;int firstsearch[1005]; int midsearch[1005];void dfs(int first,int mid,int size,int flag){ int i; if(size==1) { printf("%d ",firstsearch[first]); return ; } if(size<=0) return ; for(i=0;firstsearch[first]!=midsearch[mid+i];i++); dfs(first+1,mid,i,1); dfs(first+i+1,mid+i+1,size-i-1,1); if(flag==0) printf("%d\n",firstsearch[first]); else printf("%d ",firstsearch[first]);}int main(){ int n,i; while(~scanf("%d",&n)) { for(i=1;i<=n;i++) scanf("%d",&firstsearch[i]); for(i=1;i<=n;i++) scanf("%d",&midsearch[i]); dfs(1,1,n,0); } return 0;}
0 0
- 【二叉树之遍历的应用】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(二叉树遍历)
- 数据结构之二叉树的遍历 HDU1710 Binary Tree Traversals
- HDOJ 1710Binary Tree Traversals 二叉树的遍历
- HDU 1710 Binary Tree Traversals(二叉树的后序遍历)
- HDU 1710 Binary Tree Traversals 二叉树
- HDU 1710 Binary Tree Traversals(二叉树)
- HDU 1710 - Binary Tree Traversals(树的遍历)
- HDU1710 Binary Tree Traversals(DFS,二叉树的遍历)
- HDU 1701 Binary Tree Traversals 【二叉树】
- C++多态性分析之虚函数表
- HDU1799 循环多少次?【找规律】
- RadASM如何编辑资源并使用资源
- 高仿京东商品放大镜js
- Android下载进度条,一个通俗易懂案例
- 【二叉树之遍历的应用】HDU 1710---Binary Tree Traversals
- android 4.4 Settings分析
- CDOJ-#149 解救小Q(BFS)
- POJ 1195 Mobile phones (二维树状数组)
- nxyl4y tqx40
- hdu1799 循环多少次?
- spmh9x qgg41
- MFC 多线程 用户界面线程创建
- vrup1r gle48