#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define int long long
void dbg_out() { cerr << endl; }
template <typename H, typename... T>
void dbg_out(H h, T... t) { cerr << ' ' << h; dbg_out(t...); }
#define dbg(...) { cerr << #__VA_ARGS__ << ':'; dbg_out(__VA_ARGS__); }
using ll = long long;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

const int MAXN = 1e6+5;
const int MOD = 1e9+7; //998244353;
const int INF = 0x3f3f3f3f;
const ll INF64 = ll(4e18) + 5;

vector<int> g[MAXN];
int sz[MAXN];


void dfs(int u, int p){
	sz[u] = 1;
	for(auto v : g[u]) if(v != p){
		dfs(v,u);
		sz[u] += sz[v];
	}
}

int rec(int u, int x, int lim){
	if(lim < 0){
		return INF;
	}
	if(u == x) return 1;
	int sum = 0;
	for(auto v : g[u]){
		sum += rec(v,x,lim);
	}
	sum -= lim;
	sum = max(sum,0ll);
	sum += 1;
	return sum;
}

int RET[MAXN];
int LIV[MAXN];
int rec2(int u, int lim){
	int sum = 0;
	for(auto v : g[u]){
		sum += rec2(v,lim);
	}
	if(sum >= lim){
		LIV[u] = sum-lim;
	}else{
		LIV[u] = 0;
	}
	sum = max(sum-lim,0ll);
	sum += 1;
	RET[u] = sum;
	return RET[u];
}

int OK[MAXN];

void process(int u, int p, int tam){
	if(u != 0){
		LIV[u] = min(LIV[p],LIV[u]);
	}
	if(u == 0){
		OK[u] = 1;
	}else if(sz[u] == tam){
		int V = RET[0];
		if(V == 1){
			OK[u] = 1;
		}else{
			int dif = V-1;
			int muda = RET[u]-1;
			int k = min(LIV[p],muda);
			if(k >= dif){
				OK[u] = 1;
			}
		}
	}

	for(auto v : g[u]){
		process(v,u,tam);
	}
}


void solve(){
	int n;
	cin >> n;
	for(int i = 0; i < n; i++){
		g[i].clear();
	}
	for(int i = 0; i < n; i++){
		OK[i] = 0;
	}
	for(int i = 1; i < n; i++){
		int p;
		cin >> p;
		p--;
		g[p].pb(i);
	}
	dfs(0,0);
	vector<pair<int,int>> vs(n);
	for(int i = 0; i <n; i++){
		vs[i] = {sz[i],i};
	}
	sort(vs.begin(),vs.end());
	int l = 0;
	int r = n-1;
	string ans(n,'0');
	while(l < r){
		int mid = (l+r)/2;
		//I cannot have more than vs[mid].fi-2 since mid will get vs[mid].fi - 1
		int ret = rec(0,vs[mid].se, vs[mid].fi-2);
		if(ret == 1){
			r = mid;
		}else{
			l = mid+1;
		}
	}
	int SZ = vs[l].fi;
	//todo mundo maior serve
	for(int i = 0; i < n; i++){
		if(sz[i] > SZ) ans[i] = '1';	
	}
	ans[0] = '1';
	vector<int> op = {SZ,SZ-1};
	int mx = 0;
	for(int i = 0; i < n; i++){
		if(sz[i] >= SZ) continue;
		mx = max(mx,sz[i]);
	}
	op.pb(mx);
	int MIN = g[0].size();
	MIN += 1;
	for(auto x : op){
		if(x <= MIN) continue;
		rec2(0,x-2);
		process(0,0,x);
	}
	for(int i = 0; i < n; i++){
		if(OK[i]) ans[i] = '1';
	}
	cout << ans << '\n';
}

signed main(){

	ios::sync_with_stdio(false); cin.tie(NULL);

	int t = 1;
	cin >> t;
	while(t--){
		solve();
	}

	return 0;
}

/*
Makefile:
CXXFLAGS=-Wall -Wextra -Wshadow -g -pedantic -fsanitize=address,undefined -D_GLIBCXX_DEBUG -D_GLIBCXX_DEBUGPEDANTIC -std=gnu++17
 */