hdu 1710 Binary Tree Traversals 前序遍历和中序推后序
来源:互联网 发布:耳鸣 知乎 编辑:程序博客网 时间:2024/06/06 08:28
题链;http://acm.hdu.edu.cn/showproblem.php?pid=1710
Binary Tree Traversals
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4205 Accepted Submission(s): 1904
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
题意:给出前序历遍和中序遍历的顺序,来推导后序遍历的顺序。
做法:把握两个要点,前序是 先根历遍的,所以前序的第一个是根。然后这个根把中序分为两半,左边是左子树,右边是右子树。然后递归下就ok了。
#include <cstdio>#include <algorithm>using namespace std;struct tree{struct tree* l;struct tree* r;int val; tree(){l=NULL;r=NULL;}}; int pre[1010],in[1010];int n;tree* root;void build(int num,int l,int r,tree *rt)//pre num in_l in_r{int flag=-1;while(flag==-1){for(int i=l;i<=r;i++){if(pre[num]==in[i])flag=i;}if(flag==-1)num++;}if(flag-l>0){rt->l=(tree*)malloc(sizeof(tree));*(rt->l)=tree();build(num+1,l,flag-1,rt->l);}if(r-flag>0){rt->r=(tree*)malloc(sizeof(tree));*(rt->r)=tree();build(num+1,flag+1,r,rt->r);}rt->val=pre[num];}void post(tree* nw){if(nw->l!=NULL)post(nw->l);if(nw->r!=NULL)post(nw->r);if(nw==root)printf("%d",nw->val);elseprintf("%d ",nw->val);}void del(tree* nw){if(nw->l!=NULL)del(nw->l);if(nw->r!=NULL)del(nw->r);free(nw);}int main() {while(scanf("%d",&n)!=EOF){for(int i=0;i<n;i++)scanf("%d",&pre[i]);for(int i=0;i<n;i++)scanf("%d",&in[i]); root=(tree*)malloc(sizeof(tree));*root=tree();build(0,0,n-1,root); post(root);puts(""); del(root); } return 0;}
0 0
- hdu 1710 Binary Tree Traversals 前序遍历和中序推后序
- hdu1710 Binary Tree Traversals ----- 二叉树前序中序推后序
- 已知树的前序和中序求后序 hdu 题目1710 Binary Tree Traversals
- hdu 1710 Binary Tree Traversals(由先序和中序建树)
- 二叉树 由中序遍历和前序遍历推后序遍历
- HDU 1710 Binary Tree Traversals(二叉树的后序遍历)
- hdoj 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(二叉树遍历)
- Codeforces Round #229 (Div. 2)C. Inna and Candy Boxes
- GIT对VS工程中的无用文件过滤
- NYOJ 124 中位数(水题,nth_element()使用练习)
- LeetCode110 Blanced Binary Tree Java 题解
- C#课程设计:《猜猜看》游戏开发总结
- hdu 1710 Binary Tree Traversals 前序遍历和中序推后序
- Tomcat 启动 异常 java.lang.IllegalStateException: Unable to complete the scan for annotations...
- Android V4包下DrawerLayout的学习及回顾
- Could not find class 'javax.naming.directory.InitialDirContext'的解决办法!
- 操作系统——知识点,填空题
- Python学习笔记
- intellij idea + bitbucket + maven + spring-boot配置记录
- LRESULT CALLBACK WndProc(HWND hwnd, UINT message, WPARAM wParam, LPARAM lParam)
- 求素数