#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define Mp make_pair
#define pb push_back
#define SZ(a) (int(a.size()))

typedef long long ll;
typedef double db;
typedef std::pair<int, int> pii;
typedef std::vector<int> vi;
#define log(...) fprintf(stderr, __VA_ARGS__)
std::mt19937_64 gen(std::chrono::system_clock::now().time_since_epoch().count());
ll get(ll l, ll r) { std::uniform_int_distribution<ll> dist(l, r); return dist(gen); }

const int N = 1000100;

int n, f[N], g[N], sz[N], ans[N], z; vi G[N];
void getf(int f[], int t, int x) {
    f[x] = 0;
    for(int y : G[x]) {
        getf(f, t, y);
        f[x] += f[y];
    }
    f[x] = (x != 1) + max(f[x] - t, 0);
}
void dfs(int x, int faze) {
    sz[x] = 1;
    for(int y : G[x]) {
        dfs(y, faze && g[x] != 0);
        sz[x] += sz[y];
    }
    if(sz[x] - 1 > z) {
        ans[x] = 1;
    } else if(sz[x] - 1 == z && faze && g[1] == 1) {
        ans[x] = 1;
    } else ans[x] = 0;
}
void solve() {
    cin >> n;
    for(int i = 1; i <= n; i++) G[i].clear();
    for(int i = 2; i <= n; i++) {
        int p;
        cin >> p;
        G[p].pb(i);
    }
    int lo = 1, hi = n, mid;
    while(lo < hi) {
        mid = (lo + hi) / 2;
        getf(f, mid, 1);
        if(f[1] > 0) lo = mid + 1;
        else hi = mid;
    }
    z = lo;
    // cout << "z = " << z << '\n';
    getf(f, z, 1);
    getf(g, z - 1, 1);
    dfs(1, 1);
    for(int i = 1; i <= n; i++)
        cout << ans[i];
    cout << '\n';
}
signed main() {
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int _; cin >> _; for(int cas = 1; cas <= _; cas++) solve();
    cerr << "time: " << (db)clock()/CLOCKS_PER_SEC << "s\n";
    return 0;
}