hdu 1710 Binary Tree Traversals
来源:互联网 发布:如何下载安全软件 编辑:程序博客网 时间:2024/05/16 08:29
Binary Tree Traversals
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4721 Accepted Submission(s): 2152
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.
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<stdio.h>#include<iostream>using namespace std;int pre[1010],in[1010];int root;void BinaryTreePostOrder(int *inorder,int *preorder,int l ){if(l==0) return ;int rootindex=0;int node;node=*preorder;for(;rootindex<l;rootindex++){if(inorder[rootindex]==node) break;}BinaryTreePostOrder(inorder,preorder+1,rootindex);BinaryTreePostOrder(inorder+rootindex+1,preorder+rootindex+1,l-(rootindex+1));if(node==root) cout<<node<<endl;else cout<<node<<" ";return ;}int main(){int n;while(scanf("%d",&n)!=EOF){int i,j;for(i=0;i<n;i++) scanf("%d",&pre[i]);for(i=0;i<n;i++) scanf("%d",&in[i]);root=*pre;BinaryTreePostOrder(in,pre,n);}return 0;}
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
- iOS切换window根控制器
- Android 对回调的理解
- MapReduce编程实例之倒排索引 1
- HTML5的WebSocket
- html select下拉菜单 从数据库中读取 ajax
- hdu 1710 Binary Tree Traversals
- 数组的基本操作(一)
- Spring MVC防御CSRF、XSS和SQL注入攻击
- 移动App测试实战——专项测试
- Android软键盘遮挡的四种解决方案
- SQL*Loader-522: lfiopn failed for file (xxx.log)
- 用IO流实现文件复制功能
- 内存泄漏从入门到精通三部曲之基础知识篇
- 2015-11-24