// segmenttree
#include <bits/stdc++.h>
#define FOR(i, l, r) for(int i = (l); i <= (r); i++)
#define ROF(i, r, l) for(int i = (r); i >= (l); i--)
#define sz(a) int((a).size())
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define pii pair<int, int>
using namespace std;
const int N = 1e6 + 10;
int n;
vi g[N];
int ans[N], vis[N];
int siz[N], son[N], fa[N], dep[N], dis[N], top[N], dfn[N], dfnid;
int lim;
ll dp[N];
void dfs1(int u, int fa) {
    siz[u] = 1;
    ::fa[u] = fa;
    dep[u] = dep[fa] + 1;
    dis[u] = dis[fa] + sz(g[u]);
    son[u] = 0;
    for(auto v : g[u]) {
        dfs1(v, u);
        siz[u] += siz[v];
        if(siz[v] > siz[son[u]]) son[u] = v;
    }
}
void dfs2(int u, int tp){
    top[u] = tp;
    dfn[u] = ++dfnid;
    if(son[u]) dfs2(son[u], tp);
    for(auto v : g[u]) if(v != son[u]) dfs2(v, v);
    #define en son
    en[u] = dfnid;
}
int lca(int u, int v) {
    for(; top[u] != top[v]; ) {
        if(dep[top[u]] < dep[top[v]]) swap(u, v);
        u = fa[top[u]];
    }
    if(dep[u] > dep[v]) swap(u, v);
    return u;
}
void build(vi ver) {
    ver.emplace_back(1);
    sort(ver.begin(), ver.end(), [&](int u, int v) { return dfn[u] < dfn[v]; });
    ver.erase(unique(ver.begin(), ver.end()), ver.end());
    int n = sz(ver);
    FOR(i, 0, n - 1) ver.emplace_back(lca(ver[i], ver[(i + 1) % n]));
    sort(ver.begin(), ver.end(), [&](int u, int v) { return dfn[u] < dfn[v]; });
    ver.erase(unique(ver.begin(), ver.end()), ver.end());
    for(auto u : ver) g[u].clear();
    vi stk;
    for(auto u : ver) {
        while(!stk.empty() && en[stk.back()] < dfn[u]) stk.pop_back();
        if(!stk.empty()) g[stk.back()].emplace_back(u);
        stk.emplace_back(u);
    }
}
void dfs3(int u, int fa) {
    vis[u] = 0;
    dp[u] = 0;
    for(auto v : g[u]) {
        dfs3(v, u);
        dp[u] += dp[v];
    }
    dp[u] += dis[u] - dis[fa] - (ll)(dep[u] - dep[fa]) * (lim - 1);
    dp[u] = max(dp[u], 0ll);
}   
void dfs4(int u, int fa, int cov) {
    if(dp[u] <= 0) return;
    vis[u] = cov;
    for(auto v : g[u]) dfs4(v, u, cov);
}
void solve(vi qry) {
    dfs3(1, 0);
    dfs4(1, 0, 1);
    if(dp[1] <= 0) {
        for(auto x : qry) ans[x] = 1;
    } else if(dp[1] == 1) {
        for(auto x : qry) {
            if(vis[x]) ans[x] = 1;
        }
    }
    dfs4(1, 0, 0);
}
void Rmain() {
    cin >> n;
    FOR(i, 1, n) g[i].clear(), ans[i] = 0;
    FOR(i, 2, n) {
        int fa;
        cin >> fa;
        g[fa].emplace_back(i);
    }
    dfnid = 0;
    dep[0] = -1;
    dfs1(1, 0);
    dfs2(1, 1);
    vector<pii> qrys, adds;
    FOR(i, 1, n) if(siz[i] - 1 >= 0) qrys.emplace_back(siz[i] - 1, i);
    FOR(i, 1, n) adds.emplace_back(sz(g[i]), i);
    sort(adds.begin(), adds.end());
    sort(qrys.begin(), qrys.end());
    vi add;
    ROF(i, n, 1) {
        vi qry;
        while(!adds.empty() && adds.back().first >= i) {
            add.emplace_back(adds.back().second);
            adds.pop_back();
        }
        while(!qrys.empty() && qrys.back().first >= i) {
            qry.emplace_back(qrys.back().second);
            qrys.pop_back();
        }
        lim = i;
        build(add);
        solve(qry);
    }
    FOR(i, 1, n) cout << ans[i];
    cout << "\n";
}
int main() {
    ios :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int T;
    for(cin >> T; T--; ) Rmain();
	return 0;
}