#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define in(a, b) for (ll i = (a); i <= (b); i++)                // in using i
#define inj(a, b) for (ll j = (a); j <= (b); j++)               // in using j
#define ink(a, b) for (ll k = (a); k <= (b); k++)               // in using k
#define inl(a, b) for (ll l = (a); l <= (b); l++)               // in using l
#define inr(a, b) for(ll i = (a); i >= (b); i--)                // in reverse
#define inrj(a, b) for(ll j = (a); j >= (b); j--)                // in reverse
#define inrk(a, b) for(ll k = (a); k >= (b); k--)                // in reverse
#define inrl(a, b) for(ll l = (a); l >= (b); l--)                // in reverse
#define tt ll tcs; cin>>tcs; while(tcs--)                       // include test cases
#define ina(arr,n) ll arr[(n+1)]={0}; in(1,n) cin>>arr[i]       // input arr of n elements
#define inv(vec,n) vector<ll> vec(n+1); vec[0]=0; in(1,n) cin>>vec[i]; // input vector of n elements
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define pll pair <ll,ll>
#define vpll vector <pll>
#define sll set <ll>
#define vll vector<ll>
#define mll map <ll,ll>
#define all(x) x.begin(), x.end()
const ll mod=1e9+7;
#define vvll vector<vll>
#define pref(p,a,n) vll p(n+1); in(1,n) p[i]=p[i-1]+a[i];
#define vec2(a,n,m) vvll a(n+1,vll(m+1))
// #define vec2(a,n,m,val) vvll a(n+1,vll(m+1,val))

#define vec3(a,l,m,n) vector<vvll>a(l+1,vvll(m+1,vll(n+1)));
// #define vec3(a,l,m,n,val) vector<vvll>a(l+1,vvll(m+1,vll(n+1,val)));
# define FAST ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int main(){
    FAST
    tt{
        ll n;
        cin>>n;
        vll p(n+1);
        vvll adj(n+1);
        in(2,n){
            ll x;
            cin>>x;
            p[i]=x;
            adj[x].push_back(i);
        }
        auto ok=[&](int lim){
            function<int(int)> dfs=[&](int v)->int{
                ll cnt=0;
                for(auto x:adj[v]){
                    cnt+=1+dfs(x);
                }
                cnt-=lim;
                cnt=max(cnt,0ll);
                return cnt;
            };
            return dfs(1)==0;
        };
        ll lo=1;
        ll hi=n;
        ll bal=n;
        while(lo<=hi){
            ll mid=(lo+hi)/2;
            if(ok(mid)){
                hi=mid-1;
                bal=mid;
            }
            else{
                lo=mid+1;
            }
        }

        vll ans(n+1);
        vll xtra(n+1);
        function<int(int)>dfs=[&](int v)->int{
            ll sz=0;
            ll xter=0;
            for(auto x:adj[v]){
                sz+=1+dfs(x);
                xter+=1+xtra[x];
            }
            if(sz>bal){
                ans[v]=1;
            }
            else if(sz==bal){
                ans[v]=2;
            }
            xter-=(bal-1);
            xtra[v]=max(xter,0ll);
            return sz;
        };
        function<void(int)>dfs2=[&](int v){
            if(xtra[v]>0){
                if(ans[v]==2){
                    ans[v]=1;
                }
                for(auto x:adj[v]){
                    dfs2(x);
                }
            }
        };
        dfs(1);
        if(xtra[1]==1){
            dfs2(1);
        }
        in(1,n){
            cout<<ans[i]%2;
        }
        cout<<endl;

    }
}