#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> preOrder, postOrder;
vector<int> resultInOrder;
bool isUnique = true;
void getInOrder(int preBegin, int preEnd, int postBegin, int postEnd)
{
if (preBegin == preEnd)//该树只有一个节点
{
resultInOrder.push_back(preOrder[preBegin]);
return;
}
if (preOrder[preBegin] == postOrder[postEnd])//找到当前新的一个根节点
{
int nextRightRoot = preBegin + 1;
while (nextRightRoot <= preEnd && preOrder[nextRightRoot] != postOrder[postEnd - 1])//下一个右根节点
++nextRightRoot;
int new_preBegin = preBegin + 1;
int new_preEnd = nextRightRoot - 1;
int new_postBegin = postBegin;
int new_postEnd = postBegin + (nextRightRoot - preBegin - 2);
if (new_preEnd < new_preBegin)isUnique = false;//如果没有左子树(或者可以说是当前根节点只有一个孩子)
getInOrder(new_preBegin, new_preEnd, new_postBegin, new_postEnd);//当前根节点的左子树
//---
resultInOrder.push_back(preOrder[preBegin]);当前右根节点
//---
new_preBegin = nextRightRoot;
new_preEnd = preEnd;
new_postBegin = postBegin + (nextRightRoot - preBegin - 1);
new_postEnd = postEnd-1;
getInOrder(new_preBegin, new_preEnd, new_postBegin, new_postEnd);//当前根节点的右子树
}
}
int main()
{
int N, inputNum;
cin >> N;
preOrder.reserve(N);
preOrder.resize(N);
postOrder.reserve(N);
postOrder.resize(N);
for (int i = 0; i < N; ++i)
{
cin >> inputNum;
preOrder[i] = inputNum;
}
for (int i = 0; i < N; ++i)
{
cin >> inputNum;
postOrder[i] = inputNum;
}
getInOrder(0, N - 1, 0, N - 1);
if(isUnique)
{
cout << "Yes" << endl;
}else
{
cout << "No" << endl;
}
for (int i = 0; i < N - 1; ++i)
{
cout << resultInOrder[i] << " ";
}
cout << resultInOrder[N - 1] << endl;;
}
PAT 1119—— Pre- and Post-order Traversals(先序后序求解树)
最新推荐文章于 2021-01-13 00:47:29 发布