hdu_1710_Binary Tree Traversals(二叉树的重构)
来源:互联网 发布:js图片墙展示特效 编辑:程序博客网 时间:2024/06/15 18:44
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
根据前序与中序遍历结果输出后序结果。
代码
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int pre[1005],in[1005];int post[1005];int flag;void CreateTree(int preL,int preR,int inL,int inR){ int i; int l; int r; if(preL <= preR && inL <= inR) { for(i=inL;i<inR;i++) //根据中序排列确定左右子树 { if(pre[preL] == in[i]) //前序左边第一个是根节点,在中序以根节点为分界线分为左右子树 break; } l = i-inL; //左子树的个数 r = inR-i; //右子树的个数 if(l > 0) CreateTree(preL+1,preL+l,inL,i-1); if( r > 0) CreateTree(preL+l+1,preR,i+1,inR); //printf("%d ",pre[preL]);//后续结果存到前序数组里了 if(flag == 1) //用flag 的意义在于格式问题 { printf("%d",pre[preL]); flag = 0; } else printf(" %d",pre[preL]); }}int main(){ int n; while(scanf("%d",&n)!=EOF) { flag = 1; for(int i=0;i<n;i++) scanf("%d",&pre[i]); for(int i=0;i<n;i++) scanf("%d",&in[i]); CreateTree(0,n-1,0,n-1); printf("\n"); }}
- hdu_1710_Binary Tree Traversals(二叉树的重构)
- 数据结构之二叉树的遍历 HDU1710 Binary Tree Traversals
- hdu 1710 Binary Tree Traversals 二叉树的遍历
- HDU 1710(Binary Tree Traversals)二叉树的遍历
- 二叉树的遍历(Tree Traversals)参考极客
- HDOJ 1710Binary Tree Traversals 二叉树的遍历
- 1086. Tree Traversals Again (25) <二叉树的建立>
- HDU1710 Binary Tree Traversals(DFS,二叉树的遍历)
- HDU 1701 Binary Tree Traversals 【二叉树】
- Binary Tree Traversals(二叉树_知前序中序求后序)
- Binary Tree Traversals(二叉树)
- HDU 1710 Binary Tree Traversals 二叉树
- HDU 1710 Binary Tree Traversals(二叉树)
- 1020 Tree Traversals --二叉树乱搞
- 重建二叉树 Binary Tree Traversals HDU
- 【二叉树之遍历的应用】HDU 1710---Binary Tree Traversals
- 杭电1710 Binary Tree Traversals(二叉树的遍历)
- hdoj 1710 Binary Tree Traversals(二叉树的建立及遍历)
- 数据仓库学习笔记三
- 《数据库》基础题一:两表相关查询
- 深度学习训练图片收集器——C++截图程序的实现3(主对话框响应键鼠消息进行截图)
- 深度学习日记(二) 线性代数二
- 静态库编译连接实例
- hdu_1710_Binary Tree Traversals(二叉树的重构)
- 数据结构之堆详细介绍
- 王者荣耀高并发背后的故事
- 解决FTP文件访问需要输入用户名和密码的问题
- ORA-12541: TNS: 无监听程序 的解决办法
- Jzoj4841 平衡的子集
- SQL语句中----删除表数据drop、truncate和delete的用法
- Opencv--minEnclosingCircle源码--求最小包围圆的算法
- (机器学习基石)Machine Learning Foundations:Lecture 1