// Problem: F - Treelection
// Contest: Virtual Judge - 20231007 杂题选讲（UCup）- PB
// URL: https://vjudge.net/contest/586352#problem/F
// Memory Limit: 254 MB
// Time Limit: 3000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<stdio.h>

template<typename dy> dy max(dy x,dy y){return x>y?x:y;}
template<typename dy> dy min(dy x,dy y){return x<y?x:y;}
const int N=1e6+5;
int n,fa[N],dp[N],size[N];
bool f[N];
bool check(int x){
	for(int i=1;i<=n;i++) dp[i]=0;
	for(int i=n;i>=1;i--) dp[i]=max(dp[i]-x,0),dp[fa[i]]+=dp[i]+1;
	return !dp[1];
}
int main(){
	int T;scanf("%d",&T);
	while(T--){
		scanf("%d",&n);
		for(int i=1;i<=n;i++) size[i]=1,fa[i]=f[i]=0;
		for(int i=2;i<=n;i++) scanf("%d",&fa[i]);
		for(int i=n;i>=1;i--) size[fa[i]]+=size[i];
		int l=0,r=n;
		while(l<r){
			// printf("%d %d ",l,r);
			int mid=l+r>>1;
			if(!check(mid)) l=mid+1;
			else r=mid;
		}
		f[1]=!check(l-1);
		for(int i=2;i<=n;i++) f[i]=f[fa[i]]&dp[fa[i]];
		for(int i=1;i<=n;i++) printf("%d",(size[i]-1>l)|(size[i]-1==l&&f[i])); puts("");
	}
    return 0;
}