PAT (Advanced Level) Practise 1086 Tree Traversals Again (25)
来源:互联网 发布:surge for mac 破解版 编辑:程序博客网 时间:2024/05/04 03:48
1086. Tree Traversals Again (25)
An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that when a 6-node binary tree (with the keys numbered from 1 to 6) is traversed, the stack operations are: push(1); push(2); push(3); pop(); pop(); push(4); pop(); pop(); push(5); push(6); pop(); pop(). Then a unique binary tree (shown in Figure 1) can be generated from this sequence of operations. Your task is to give the postorder traversal sequence of this tree.
Figure 1
Input Specification:
Each input file contains one test case. For each case, the first line contains a positive integer N (<=30) which is the total number of nodes in a tree (and hence the nodes are numbered from 1 to N). Then 2N lines follow, each describes a stack operation in the format: "Push X" where X is the index of the node being pushed onto the stack; or "Pop" meaning to pop one node from the stack.
Output Specification:
For each test case, print the postorder traversal sequence of the corresponding tree in one line. A solution is guaranteed to exist. All the numbers must be separated by exactly one space, and there must be no extra space at the end of the line.
Sample Input:6Push 1Push 2Push 3PopPopPush 4PopPopPush 5Push 6PopPopSample Output:
3 4 2 6 5 1
用栈模拟弄出二叉树然后输出后序遍历。
#include<cstdio>#include<stack>#include<string>#include<vector>#include<cstring>#include<iostream>#include<algorithm>using namespace std;typedef long long LL;const int maxn = 1e5 + 10;int n, ch[maxn][2], root, x, bef, vec;stack<int> p;char s[maxn];void dfs(int x){if (!x) return;dfs(ch[x][0]);dfs(ch[x][1]);printf("%d%s", x, root == x ? "\n" : " ");}int main(){scanf("%d", &n);n <<= 1;while (n--){scanf("%s", s);if (strcmp(s, "Push")){bef = p.top(); vec = 1;p.pop();}else{scanf("%d", &x);if (!root) root = x;ch[bef][vec] = x;bef = x;vec = 0;p.push(x);}}dfs(root);return 0;}
- PAT (Advanced Level) Practise 1086 Tree Traversals Again (25)
- PAT (Advanced Level) Practise 1086 Tree Traversals Again (25)
- 1086. Tree Traversals Again (25)【二叉树】——PAT (Advanced Level) Practise
- 1020. Tree Traversals (25) @ PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1020. Tree Traversals (25)
- 浙大PAT (Advanced Level) Practise 1020Tree Traversals (25)
- 1020. Tree Traversals (25)——PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1020 Tree Traversals (25)
- PAT (Advanced Level) Practise 1020. Tree Traversals (25)
- PAT (Advanced Level) Practise 1020 Tree Traversals (25)
- Pat(Advanced Level)Practice--1086(Tree Traversals Again)
- 【PAT】【Advanced Level】1086. Tree Traversals Again (25)
- 【PAT Advanced Level】1020. Tree Traversals (25)
- PAT (Advanced Level) 1020. Tree Traversals (25)
- 【PAT】【Advanced Level】1020. Tree Traversals (25)
- PAT Advanced Level 1086. Tree Traversals Again (25)(Java and C++)
- PAT (Advanced Level) 1086. Tree Traversals Again (25) 根据先根遍历数组创建树
- PAT Advanced Level 1020. Tree Traversals (25)(Java 实现)
- Spring整合Shiro做权限控制模块详细案例分析
- Apache Shiro 学习
- 关于sqlite数据库的优化
- activemq 控制面板里的 Number Of Pending Messages、 Messages Enqueued、Messages Dequeued含
- 使用SoapUI 测试Web Service
- PAT (Advanced Level) Practise 1086 Tree Traversals Again (25)
- 手把手教你搭建powerpc(P2020)的ltib编译环境
- 代码零件
- Spring组件扫描<context:component-scan/>使用详解
- 二叉树的深度优先遍历和广度优先遍历
- MyBatis MapperScannerConfigurer配置
- spring注解注入:<context:component-scan>详解
- FragmentPagerAdapter刷新fragment
- 个人