pta--玩转二叉树

#include <bits/stdc++.h>
using namespace std;
typedef struct node *tree;
int in[1000], pre[1000];
struct node
{
    int data;
    tree left, right;
};

tree build(int in[], int pre[], int n)
{
    tree t;
    if (!n)
        return NULL;
    t = (tree)malloc(sizeof(struct node));
    t->data = pre[0];
    t->left = t->right = NULL;
    int i;
    for (i = 0; i < n; i++)
    {
        if (in[i] == pre[0])
            break;
    }
    t->left = build(in, pre + 1, i);
    t->right = build(in + i + 1, pre + i + 1, n - i - 1);
    return t;
}

tree change(tree t)
{
    tree m;
    if (t)
    {
        if (t->left != NULL || t->right != NULL)
        {
            m = t->left;
            t->left = t->right;
            t->right = m;
        }
        change(t->left);
        change(t->right);
    }
    return t;
}

void cengci(tree t, int n)
{
    tree q[100], p;
    int ll = 0, rr = 0, len = 0;
    if (t)
    {
        q[rr++] = t;
        while (ll != rr)
        {
            p = q[ll++];
            printf("%d", p->data);
            len++;
            if (len != n)
            {
                printf(" ");
            }
            else
                cout << endl;
            if (p->left != NULL)
                
            q[rr++] = p->left;
            if (p->right != NULL)
            {
                q[rr++] = p->right;
            }
        }
    }
}
int main()
{
    tree t;
    int i, n;
    cin >> n;
    for (i = 0; i < n; i++)
    {
        cin >> in[i];
    }
    for (i = 0; i < n; i++)
    {
        cin >> pre[i];
    }
    t = build(in, pre, n);
    t = change(t);
    cengci(t, n);
    return 0;
}