13 数据结构课程设计小组任务13：二叉树的重建（前序、中序）

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <sstream>
#include <stack>
#include <map>
#include <ctime>
#include <array>
#include <set>
#include <list>
using namespace std;

template <class ElemType>
struct BinaryTreeNode
{
    ElemType data;
    struct BinaryTreeNode *lchild;
    struct BinaryTreeNode *rchild;
};

template <class ElemType>
BinaryTreeNode<ElemType> *reConstructCore(ElemType pre[], ElemType in[], int preStart, int preEnd, int inStart, int inEnd)
{
    if (inStart > inEnd)
        return NULL;
    ElemType rootdata = pre[preStart];
    int mid = -10;
    for (int i = inStart; i <= inEnd; i++)
        if (in[i] == rootdata)
        {
            mid = i;
            break;
        }
    BinaryTreeNode<ElemType> *root = new BinaryTreeNode<ElemType>;
    root->data = rootdata;
    root->lchild = reConstructCore(pre, in, preStart + 1, preStart + mid - inStart, inStart, mid - 1);
    root->rchild = reConstructCore(pre, in, preStart + mid - inStart + 1, preEnd, mid + 1, inEnd);
    return root;
}

bool flag = 1;
template <class ElemType>
void PosOrder(BinaryTreeNode<ElemType> *t)
{
    if (t == NULL)
        ;
    else
    {
        PosOrder(t->lchild);
        PosOrder(t->rchild);
        if (flag)
        {
            cout << t->data;
            flag = 0;
        }
        else
            cout << "," << t->data;
    }
}

int main()
{
    char pre[100000];
    char in[100000];
    int num = 0;
    string str;
    getline(cin, str);
    stringstream ss(str);
    while (ss >> pre[num++])
        ;
    num = 0;
    getline(cin, str);
    stringstream st(str);
    while (st >> in[num++])
        ;
    BinaryTreeNode<char> *t;
    t = reConstructCore(pre, in, 0, num - 2, 0, num - 2);
    PosOrder(t);
    cout << endl;
    return 0;
}