【PAT (Advanced Level) Practice】1086 Tree Traversals Again (25 分)

众所周知只有前序遍历和后序遍历是不可能推出中序遍历的，所以我就不废话了

由树的前序遍历和中序遍历可以推后序遍历
由树的中序遍历和后序遍历可以推前序遍历


#include <cstdio>
#include <vector>
#include <stack>
#include <cstring>
using namespace std;
vector<int> pre, in, post,value;
void postorder(int root, int start, int end) {if (start > end) return;int i = start;while (i < end && in[i] != pre[root]) i++;

【PAT (Advanced Level) Practice】1086 Tree Traversals Again (25 分)相关推荐

【PAT (Advanced Level) Practice】1051 Pop Sequence (25 分)
1051 Pop Sequence (25 分) Given a stack which can keep M numbers at most. Push N numbers in the order ...
【PAT (Advanced Level) Practice】1037 Magic Coupon (25 分)
题意: 给出两个集合,从这两个集合里面选出数量相同的元素进行一对一相乘,求能够得到的最大乘积之和. 题解: 对每个集合,将正数和负数分开考虑,将每个集合里的整数从大到小排序:将每个集合里的负数从小到大 ...
PAT (Advanced Level) Practice 1011 World Cup Betting (20 分) 凌宸1642
PAT (Advanced Level) Practice 1011 World Cup Betting (20 分) 凌宸1642 题目描述: With the 2010 FIFA World Cu ...
1086 Tree Traversals Again (25分)
1 题目 1086 Tree Traversals Again (25分) An inorder binary tree traversal can be implemented in a non-r ...
【PAT (Advanced Level) Practice】1041 Be Unique (20 分)
1041 Be Unique (20 分) Being unique is so important to people on Mars that even their lottery is desi ...
【PAT (Advanced Level) Practice】1050 String Subtraction (20 分)
C/C++中整型数组的下标类型不一定为整型,C C++语言下数组性质与散列有些类似,即散列中的键值对:下标即为关键码,关键码通过散列函数映射得到元素即为值下标可以为整型,也可以为字符型,简单案例如下 ...
【PAT (Advanced Level) Practice】1120 Friend Numbers (20 分)
1120 Friend Numbers (20 分) Two integers are called "friend numbers" if they share the same ...
PAT (Advanced Level) Practice - 1107 Social Clusters（30 分）
题目链接:点击打开链接题目大意:一个"社交集群"是指部分兴趣爱好相同的人的集合.你需要找出所有的社交集群. 解题思路:并查集思路,轮到第几个人时,以它的 id 为 root,然后 ...
1086 Tree Traversals Again (25 分)【一般 / 建树树的遍历】
https://pintia.cn/problem-sets/994805342720868352/problems/994805380754817024 首先要知道的是: 入栈顺序就是树的前序遍历的 ...

【PAT (Advanced Level) Practice】1086 Tree Traversals Again (25 分)

【PAT (Advanced Level) Practice】1086 Tree Traversals Again (25 分)相关推荐

最新文章

热门文章