#include<bits/stdc++.h>

using namespace std;

#define int long long int
#define PB   push_back
using pii = pair<int, int>;
using vi  = vector<int>;
using vvi = vector<vi>;
#define Endl "\n"
#define sixeof sizeof
#define NOT ~
static int tc = 0;
const int mxn = 1e6+2;
const int lgn = 20;
const int mod = (119<<23)+1;
// const int mod = 1e9+7;

int bigMod(int b, int p, const int mod) {
    int res = 1;
    b%=mod;
    while(p) {
        if(p&1) res = (res * b)%mod;
        b = (b * b)%mod;
        p/=2;
    }
    return res;
}
// a
// z
int mul(long long x, long long y) {
    x*=y;
    return (int)(x%mod);
}
int add(long long x, long long y) {
    x+=y;
    if(x>=mod) x-=mod;
    if(x<mod) x+=mod;
    return (int)x;
}
int p[mxn], s[mxn], notPush[mxn], cnt[mxn], go[mxn];
int n;
int ch(int lim) {
    for(int i=1; i<=n; i++) s[i] = 0, cnt[i]=0, go[i] = 0;
    for(int i=n; i>=2; i--) {
        s[p[i]]+=s[i]+1;
        cnt[p[i]]+=(cnt[i]<=lim?0ll:cnt[i]-lim)+1;
        if(cnt[i]<=lim) go[i] = 1;
    }
    return (cnt[1]<=lim);
}
void solve() {
    cin >> n;
    for(int i=2; i<=n; i++) cin >> p[i];
    int lo = 1, hi = n;
    while(lo<hi) {
        int mid = (lo+hi)/2;
        if(ch(mid)) hi = mid;
        else lo = mid+1;
    }
    ch(hi-1);
    for(int i=2; i<=n; i++) go[i]|=go[p[i]];
    int ok = cnt[1]-hi+1;
    if(ok<0) ok = 0;
    for(int i=1; i<=n; i++) {
        if(s[i]>hi) cout <<"1";
        else if(s[i]==hi && ((ok==0 || (ok==1 && go[i]==0)))) cout <<"1";
        else cout <<"0";
    }
    cout << Endl;
}
int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t, tc=1;
    for(cin >> t; tc<=t; tc++)

    {
        // cout <<"Case "<<tc<<":\n";
//             cout << "Case #"<<tc<<": ";
        solve();
    }
}
// a