二叉树----前序和中序序列得到后序序列

#include <iostream>
using namespace std;

const int maxn = 100;

typedef struct Node
{
    int key;
    struct Node *left;
    struct Node *right;
}treeNode;

int preOrder[maxn];
int midOrder[maxn];

// 由中序和后序序列创建树
treeNode *createTree(int preLeft, int preRight, int midLeft, int midRight)
{
    if (preRight - preLeft < 0) return NULL;
    treeNode *root = new treeNode;
    root->key = preOrder[preLeft];
    if (preRight == preLeft)
    {
        root->left = NULL;
        root->right = NULL;
    }

    int index;
    for (index = midLeft; index <= midRight; ++index)
    {
        if (midOrder[index] == preOrder[preLeft]) break;
    }
    root->left = createTree(preLeft + 1, preLeft + (index - midLeft), midLeft, index - 1);
    root->right = createTree(preLeft + (index - midLeft) + 1, preRight, index + 1, midRight);
    return root;
}


void postOrder(treeNode *root)
{
    if (root != NULL)
    {
        postOrder(root->left);
        postOrder(root->right);
        cout << root->key << " ";
    }
}

int main()
{
    int n;
    cout << "Input the number of Node: " << endl;
    cin >> n;
    cout << "The preOrder: " << endl;
    for (int i = 0; i < n; ++i)
        cin >> preOrder[i];
    cout << "The midOrder: " << endl;
    for (int i = 0; i < n; ++i)
        cin >> midOrder[i];
    treeNode *root = createTree(0, n - 1, 0, n - 1);
    cout << "The postOrder: " << endl;
    postOrder(root);
    cout << endl;
    system("pause");
    return 0;

}