#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 8e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
ll t,n,head[1000010],cnt=0,fa[1000010],siz[1000010],f[1000010],w;
bl ck[1000010],ans[1000010];
struct node{
	ll nxt,to;
}e[1000010];
void add(ll u,ll v){
	e[++cnt].nxt=head[u];
	e[cnt].to=v;
	head[u]=cnt;
}
void dfs0(ll u){
	siz[u]=1;
	go(u){
		ll v=e[i].to;
		dfs0(v);
		siz[u]+=siz[v];
	}
}
void dfs(ll u){
	f[u]=0;
	go(u){
		ll v=e[i].to;
		dfs(v);
		f[u]+=f[v];
	}
	f[u]=max(0ll,f[u]-w);
	if(u!=1) f[u]++;
}
il void clr(){
	fr(i,1,n) head[i]=ck[i]=ans[i]=0;
	cnt=0;
}
int main(){
	t=read();
	while(t--){
		n=read();
		fr(i,2,n){
			fa[i]=read();
			add(fa[i],i);
		}
		dfs0(1);
		ll l=1,r=n-1;
		while(l<r){
			ll mid=(l+r)>>1;
			w=mid;
			dfs(1);
			if(!f[1]) r=mid;
			else l=mid+1;
		}
		w=l-1;
		dfs(1);
		fr(i,2,n){
			if(fa[i]==1) ck[i]=(f[1]==1);
			else ck[i]=ck[fa[i]]&(f[fa[i]]>1);
		}
		ans[1]=1;
		fr(i,2,n){
			if((siz[i]-1)>l) ans[i]=1;
			else if(ck[i]&&(siz[i]-1)==l) ans[i]=1;
		}
		fr(i,1,n) pc('0'+ans[i]);
		enter;
		clr();
	}
}