#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pi pair<int,int>
#define pb push_back
#define ls (rt<<1)
#define rs (rt<<1|1)
#define mp make_pair
#define lowbit(i) (i&(-i))
#define mid ((l+r)/2)
inline int read(){
    int x=0;char ch=getchar();bool f=0;
    for(;!isdigit(ch);ch=getchar())if(ch=='-')f=1;
    for(;isdigit(ch);ch=getchar())x=(x<<1)+(x<<3)+(ch^48);
    if(f)x=-x;return x;
}
const int maxn=1e6+5,mod=1e9+9;
int x,y,n,m,res,T,cnt;
int g[maxn],sz[maxn],t[maxn];
vector<int>e[maxn];
void dfs(int x){
	sz[x]=1;
	for(auto i:e[x]){
		dfs(i);sz[x]+=sz[i];
	}
}
int dfs1(int x,int y){
	if(t[x])return 0;
	int u=-y;
	for(auto i:e[x]){
		int z=dfs1(i,y)+1;
		u+=z;
	}
	return max(0,u);
}
bool check(int y){
	if(dfs1(1,y)>0)return 0;
	return 1;
}
void get(){
	int l=1,r=n;
	while(l<=r){
		if(check(mid))res=mid,r=mid-1;
		else l=mid+1;
	}
}
void solve(){
	cin>>n;
	for(int i=1;i<=n;i++)e[i].clear(),g[i]=sz[i]=t[i]=0;
	for(int i=2;i<=n;i++)cin>>x,e[x].pb(i);
	dfs(1);get();cnt=0;
	for(int i=1;i<=n;i++)if(e[i].size()==res&&sz[i]==res+1)cnt++;
	
	for(int i=1;i<=n;i++){
		if(sz[i]-1>res)putchar('1');
		else if(sz[i]-1<res)putchar('0');
		else{
			if(e[i].size()!=res)putchar('0');
			else{
				t[i]=1;
				if(dfs1(1,res-1)>0)putchar('0');
				else putchar('1');
				t[i]=0;
			}
		}
	}puts("");
}
signed main(){
    std::ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>T;
	while(T--)solve();
	
    return 0;
}