Sicily 1935 二叉树重建

题目要求说的很清楚，给出一个数的先序和中序遍历结果，构建树并按照广度优先输出。先序遍历的第一个数即为根节点，在中序遍历中找到之后它左面的都是左子孙结点右边同理。

// Problem#: 1935
// Submission#: 3291146
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
#include<iostream>
#include<queue>
#include<string>
using namespace std;
struct Tree {
    char c;
    Tree *left, *right;
};
Tree* build(string pre, string in) {
    Tree *root = NULL;
    if (pre.length() > 0) {
        root = new Tree;
        char ch = pre[0];
        root->c = ch;
        int pos = in.find(ch);
        root->left = build(pre.substr(1, pos), in.substr(0, pos));
        root->right = build(pre.substr(pos + 1), in.substr(pos + 1));
    }
    return root;
}
int main() {
    int n;
    cin >> n;
    while (n--) {
        string pre, in;
        cin >> pre >> in;
        
        Tree *t = build(pre, in);
        queue<Tree*> que;
        que.push(t);
        while (!que.empty()) {
            Tree *temp = que.front();
            que.pop();
            cout << temp->c;
            if (temp->left != NULL) {
                que.push(temp->left);
            }
            if (temp->right != NULL) {
                que.push(temp->right);
            }
        }
        cout << endl;
    }
}