PAT 甲级 1020. Tree Traversals
来源:互联网 发布:北京现代软件学院网站 编辑:程序博客网 时间:2024/06/06 14:08
原题传送门
- 树的遍历 之 已知后序和中序输出层序
#include <iostream>#include <vector>using namespace std;vector<int> post, in, level(100000, -1);void pre(int root, int start, int end, int index) { if(start > end) return; int i = start; while(i < end && in[i] != post[root]) ++i; level[index] = post[root]; pre(root-1-(end-i), start, i-1, 2*index+1); pre(root-1, i+1, end, 2*index+2);}int main(int argc, const char * argv[]) { int n; cin >> n; post.resize(n); in.resize(n); for(int i = 0; i < n; ++i) cin >> post[i]; for(int i = 0; i < n; ++i) cin >> in[i]; pre(n-1, 0, n-1, 0); cout << level[0]; for(int i = 1; i < level.size(); ++i) { if(level[i] != -1) cout << " " << level[i]; } return 0;}
附原题:
Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, you are supposed to output the level order traversal sequence of the corresponding binary tree.
- Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N (<=30), the total number of nodes in the binary tree. The second line gives the postorder sequence and the third line gives the inorder sequence. All the numbers in a line are separated by a space.
- Output Specification:
For each test case, print in one line the level order traversal sequence of the corresponding binary tree. All the numbers in a line must be separated by exactly one space, and there must be no extra space at the end of the line.
- Sample Input:
7
2 3 1 5 7 6 4
1 2 3 4 5 6 7 - Sample Output:
4 1 6 3 5 7 2
- PAT 甲级 1020. Tree Traversals
- [PAT-甲级]1020.Tree Traversals
- PAT 甲级 1020. Tree Traversals
- 【PAT甲级】1020. Tree Traversals (25)
- PAT甲级.1020. Tree Traversals (25)
- 1020. Tree Traversals (25) PAT甲级
- PAT甲级练习1020. Tree Traversals (25)
- PAT甲级1020. Tree Traversals (25)
- PAT甲级 1020. Tree Traversals (25)
- PAT 甲级 1020. Tree Traversals (25)
- 1020. Tree Traversals (25)-PAT甲级真题
- pat甲级 1020. Tree Traversals map递归建树 + BFS
- PAT甲级练习题A1020. Tree Traversals (25)
- PAT甲级.1086. Tree Traversals Again (25)
- 1086. Tree Traversals Again (25) PAT甲级
- PAT 甲级 1086. Tree Traversals Again (25)
- 【PAT】1020. Tree Traversals
- PAT 1020. Tree Traversals
- JS鼠标事件大全 推荐收藏
- 使用jQuery的hover事件在IE中不停闪动的解决方法
- Android java到Kotlin的基本语法
- Web安全知多少
- adb install 流程分析
- PAT 甲级 1020. Tree Traversals
- Android 蓝牙Bluetooth搜索设备。
- CSS3的calc()使用
- 【转】秒杀系统架构分析与实战
- linux下用cmake对caffe静态编译时-static-libstdc++参数无效的问题
- svn服务器安装
- Apache 2.4.16、PHP5.6.11安装教程
- js中toString、toLocaleString、valueOf函数区别
- C++ Heap corruption detected