无需构建二叉树(PAT中大部分的二叉树题都没必要构建)
注意用先读出前序、中序序列存到pre[ ]、in[ ]数组中
再用pre[ ]、in[ ]数组来构建post[ ]数组,然后输出即可
#include<iostream>
#include<string>
#include<stack>
using namespace std;
int n, cnt1 = 1, cnt2 = 1;
int pre[35], in[35], post[35];
void creat(int l1, int r1, int l2, int r2, int l3, int r3)//pre[l1,r1]、in[l2,r2]、post[l3,r3]
{
if (l1 > r1) return; //递归到了NULL节点,返回即可
post[r3] = pre[l1];
int i = l2, len;
for (;i < r2;i++)
if (in[i] == pre[l1]) break;
len = i - l2;
creat(l1 + 1, l1 + len, l2, i - 1, l3, l3 + len - 1); //左子树
creat(l1 + len + 1, r1, i + 1, r2, l3 + len, r3 - 1); //右子树
}
int main()
{
cin >> n;
stack<int> st;
string s;
for (int i = 0;i < 2 * n;i++) {
cin >> s;
if (s == "Push") cin >> pre[cnt1], st.push(pre[cnt1++]);
if (s == "Pop") in[cnt2++] = st.top(), st.pop();
}
creat(1, n, 1, n, 1, n);
for (int i = 1;i <= n;i++)
printf("%d%c", post[i], i == n ? '\n' : ' ');
system("pause");
return 0;
}