백준(BOJ) 4526 트리 *

#dfs

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define MAX 200005
#define INF 987654321
#define MOD 31991
#pragma warning(disable:4996)
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;

int n, pre[1000], node[1000];
void dfs(int now,int s, int e)
{
    int i;
    if (s > e)
        return;
    if (s == e)
    {
        printf("%d ", pre[now]);
        return;
    }
    for (i = s; i <= e; i++)
        if (node[i] == pre[now])
            break;
    dfs(now+1,s, i - 1);
    dfs(now+i-s+1,i + 1, e);
    printf("%d ", pre[now]);
    return;
}
int main()
{
    int tc;
    scanf("%d", &tc);
    while (tc--)
    {
        scanf("%d", &n);
        for (int i = 0; i < n; i++)
            scanf("%d", &pre[i]);
        for (int i = 0; i < n; i++)
            scanf("%d", &node[i]);
        dfs(0, 0, n - 1);
        printf("\n");
    }
    return 0;
}