#include<bits/stdc++.h>
using namespace std;
namespace IO_ER{
    #define LL long long
    #define db double
    #define U unsigned
    #define ULL U LL
    #define In inline
    #define Re register
    #define f(a,b,i) for(int i=a;i<=b;i++)
    #define ff(a,b,i) for(int i=a;i<b;i++)
    #define f_(a,b,i) for(int i=a;i>=b;i--)
    #define ff_(a,b,i) for(int i=a;i>b;i--)
    typedef pair<LL,int> Pi;
    int inf=0x3f3f3f3f;
    int INF=0x7fffffff;
    LL infll=0x3f3f3f3f3f3f3f3fll;
    LL INFll=0x7fffffffffffffffll;
    template<typename T>void read(T &x){
        x=0;
        int fl=0;
        char ch=getchar();
        while(ch<'0'||'9'<ch){
            if(ch=='-')fl=1;
            ch=getchar();
        }
        while('0'<=ch&&ch<='9'){
            x=(x<<1)+(x<<3)+(ch^48);
            ch=getchar();
        }
        x=fl?-x:x;
    }
    template<typename T,typename ...Args>void read(T &x,Args &...args){
        read(x);
        read(args...);
    }
}
using namespace IO_ER;

#define N 100050

int n;

int fa[N];

int sz[N];

int dp[N];

In bool pd(int x){
    f(1,n,i)dp[i]=0;
    f_(n,2,i){
		dp[i]=max(dp[i]-x,0);
        dp[fa[i]]+=dp[i]+1;
    }
    return dp[1]<=x;
}

int tag[N];

int main(){
    int Ti;
    read(Ti);
    while(Ti--){
        read(n);
        f(2,n,i)read(fa[i]);
        f(1,n,i)tag[i]=sz[i]=0;
        f_(n,2,i)sz[fa[i]]+=sz[i]+1;
        int l=1,r=n;
        int ans=0;
        while(l<=r){
            int mid=(l+r)>>1;
            if(pd(mid))ans=mid,r=mid-1;
            else l=mid+1;
        }
        pd(ans-1);
        if(dp[1]==ans){
            tag[1]=1;
            f(2,n,i)tag[i]=(tag[fa[i]]&&dp[i]);
        }
        f(1,n,i){
            if(sz[i]>ans||(sz[i]==ans&&tag[i]))putchar('1');
            else putchar('0');
        }
        puts("");
    }
    return 0;
}