玩转二叉树 关于镜像二叉树 只是遍历的时候修改了 左右顺序就可以了 没必要另外开辟空间

#include <bits/stdc++.h>
using namespace std;
struct Tnode
{
     int data;
     struct Tnode* left;
     struct Tnode* right;

};
typedef struct Tnode* Btree;
const int maxn=31;
int in[maxn],pre[maxn];
Btree get_root(int prel,int prer,int inl,int inr)
{
       int k;
    if(prel>prer)
       return NULL;
    Btree root=new struct Tnode;
    root->data=pre[prel];
    for(k=inl;k<=inr;++k)
    {
         if(pre[prel]==in[k])
              break;

    } //此时根节点在中序遍历的位置下标为k 左子树有k-inl 右子树有 inr-k
    root->left=get_root(prel+1,prel+k-inl,inl,k-1);
    root->right=get_root(prel+k-inl+1,prer,k+1,inr);
    return root;
}
void layer_travel(Btree root)
{
    int flag=1;
   queue<Btree>q;//树的层次遍历 队列里面存放的地址
   q.push(root);
   while(!q.empty())
   {
      Btree f=q.front();
      q.pop();
      if(flag)
      {
           cout<<f->data;
           flag=0;

      }
      else
       cout<<" "<<f->data;

      if(f->right)
       q.push(f->right);
       if(f->left)
        q.push(f->left);
   }


}
int main()
{
    int n;
    cin>>n;
    for(int i=0;i<n;++i)
       cin>>in[i];
     for(int i=0;i<n;++i)
       cin>>pre[i];
    Btree root=get_root(0,n-1,0,n-1);
     layer_travel(root);


    return 0;
}