PAT (Advanced Level) Practice A1020 Tree Traversals （25 分）(C++)（甲级）（二叉树，由后序中序得层次）（两种解法）

原题链接：A1020 Tree Traversals

#include<algorithm>
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;

typedef struct LevelOrder
{
    int data;//层次遍历的数据
    int level;//遍历的层次
}LevelOrder;
LevelOrder L[35];

int Post[35], In[35], N, cnt = 0;
//l1r1是Post的两个指针，l2r2是In的两个指针，level表示现在在扫描的层次
void getLevelOrder(int l1, int r1, int l2, int r2, int level)
{
    if(l1 >= r1 || l2 >= r2) return ;//递归结束条件
    L[cnt].level = level;//后序遍历的最后一个就是该分支上的根节点
    L[cnt++].data = Post[r1-1];
    int k = l2;
    while(k < r2 && In[k] != Post[r1-1]) k++;//在中序中查找该节点，把中序序列分割成左右两部分
    getLevelOrder(l1, l1+k-l2, l2, k, level+1);//再把这两部分递归就行了
    getLevelOrder(l1+k-l2, r1-1, k+1, r2, level+1);
}

bool cmp(LevelOrder A, LevelOrder B)
{
    return A.level < B.level;
}

int main()
{
    scanf("%d", &N);
    int i;
    for(i=0; i<N; i++) scanf("%d", &Post[i]);
    for(i=0; i<N; i++) scanf("%d", &In[i]);
    getLevelOrder(0, N, 0, N, 1);
    stable_sort(L, L+N, cmp);//需要稳定排序；sort基于快速排序实现，是一种不稳定排序
    printf("%d", L[0].data);//打印注意格式
    for(i=1; i<N; i++) printf(" %d", L[i].data);
    return 0;
}

#include<algorithm>
#include<iostream>
#include<cstdio>
#include<cstring>
#include <queue>
using namespace std;

typedef struct BiTNode
{
    int data;
    struct BiTNode *lChild, *rChild;
}BiTNode, *BiTree;

const int MAX = 50;
int Post[MAX], In[MAX];

BiTree buildTree(int inL, int inR, int postL, int postR)//根据中后序建树
{
    if(inL >= inR || postL >= postR) return NULL;
    int k = inL;
    while(k < inR && In[k] != Post[postR-1]) k++;
    BiTree ROOT = new BiTNode;
    ROOT->data = Post[postR-1];
    ROOT->lChild = buildTree(inL, k, postL, postL+k-inL);
    ROOT->rChild = buildTree(k+1, inR, postL+k-inL, postR-1);
    return ROOT;
}

void levelOrder(BiTree T)//中序遍历
{
    int flag = 0;
    queue<BiTree> Q;
    Q.push(T);
    while(!Q.empty())
    {
        T = Q.front();
        Q.pop();
        if(!flag) printf("%d", T->data), flag = 1;
        else printf(" %d", T->data);
        if(T->lChild) Q.push(T->lChild);
        if(T->rChild) Q.push(T->rChild);
    }
}

int main()
{
    int N;
    scanf("%d", &N);
    for(int i=0; i<N; i++) scanf("%d", &Post[i]);
    for(int i=0; i<N; i++) scanf("%d", &In[i]);
    BiTree ROOT = buildTree(0, N, 0, N);
    levelOrder(ROOT);
	return 0;
}