CCCC-GPLT l2-011 玩转二叉树 二叉树

给出一棵二叉树的前序和中序,将二叉树镜面反转后输出它的层序.

第4题和第6题都是二叉树的题,正好手热.
递归得出所有父子关系,层序用队列输出,输出时先右再左即可实现反转.

/* LittleFall : Hello! */
#include <bits/stdc++.h>
#define ll long long
using namespace std;
inline int read();
inline void write(int x);
const int M = 100016;
int pre[M],mid[M];
pair<int,int> tree[M];
void solve(int p_l,int p_r,int m_l,int m_r) //闭区间
{
    int root=pre[p_l],m_m;
    for(m_m=m_l;m_m<=m_r;m_m++)
        if(mid[m_m]==root) break;
    int n_l=m_m-m_l,n_r=m_r-m_m;
    if(n_l>0)
    {
        tree[root].first=pre[p_l+1];
        solve(p_l+1,p_l+n_l,m_l,m_m-1);
    }
    if(n_r>0)
    {
        tree[root].second=pre[p_l+1+n_l];
        solve(p_l+1+n_l,p_r,m_m+1,m_r);
    }
}
int main(void)
{
    #ifdef _LITTLEFALL_
    freopen("in.txt","r",stdin);
    #endif
    //std::cin.sync_with_stdio(false); 

    int n=read();
    for(int i=0;i<n;i++) mid[i]=read();
    for(int i=0;i<n;i++) pre[i]=read();
    int root=pre[0];
    solve(0,n-1,0,n-1);
    queue<int> q;
    printf("%d",root );
    q.push(root);
    while(!q.empty())
    {
        int x=q.front();q.pop();
        if(tree[x].second)
        {
            printf(" %d",tree[x].second );
            q.push(tree[x].second);
        }
        if(tree[x].first)
        {
            printf(" %d",tree[x].first );
            q.push(tree[x].first);
        }
    }
    printf("\n");
    return 0;
}


inline int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9') {if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
inline void write(int x)
{
     if(x<0) putchar('-'),x=-x;
     if(x>9) write(x/10);
     putchar(x%10+'0');
}