#include <iostream>#include <cstdio>#include <queue>#include <cstring>using namespace std;const int MAXN = 100;struct Node {    char value;    Node *left_child;    Node *right_child;    Node () {        left_child = right_child = NULL;    }};bool first = true;void Pre_order(Node *tree) {    if(first) {        cout << tree->value;        first = false;    } else cout << " " << tree->value;    if(tree->left_child != NULL) {        Pre_order(tree->left_child);    }    if(tree->right_child != NULL) {        Pre_order(tree->right_child);    }}Node* build(char pos[], char in[], int n) {    if(n == 0) return NULL;    Node *tmp = new Node;    for(int i = 0; i < n; i++) {        if(in[i] == pos[n-1]) {            tmp->value = http://www.mamicode.com/pos[n-1];            tmp->left_child = build(pos, in, i);            tmp->right_child = build(pos+i, in+i+1, n-i-1);            return tmp;        }    }    return NULL;}int main() {    int n;    char posorder[MAXN], inorder[MAXN];    scanf("%d", &n);    first = false;    scanf("%s", inorder);    scanf("%s", posorder);    Node *tree = build(posorder, inorder, n);    Pre_order(tree);    return 0;}